Revision as of 21:18, 29 May 2010 edit BlackJack (talk \| contribs) Extended confirmed users 100,277 edits →Nash equilibrium ← Previous edit		Revision as of 16:55, 6 September 2010 edit undo Yobot (talk \| contribs) Bots 4,733,870 edits m →Nash equilibrium: WP:CHECKWIKI error fixes + genfixes using AWB (7092) Next edit →
Line 22: Finding Nash equilibrium in a game takes exponential time in the size of the representation. If the graphical representation of the game is a tree, we can find the equilibrium in polynomial time. In the general case, where the maximal degree of a node is 3 or more, the problem is [[NP-complete]]. [[Category:Game theory]]▼ [[he:משחק בצורה גרפית]] ▲[[Category:Game theory]]

Graphical game theory: Difference between revisions