Content deleted Content added
Rewrite lead |
Aadirulez8 (talk | contribs) m v2.05 - Fix errors for CW project (Reference list missing / disambiguation page with disallowed <ref>) |
||
Line 24:
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]].
==
{{Reflist}}
* Michael Kearns (2007) "[http://www.cis.upenn.edu/~mkearns/papers/agt-kearns.pdf Graphical Games]". In {{Cite Algorithmic Game Theory 2007}}
* Michael Kearns, Michael L. Littman and Satinder Singh (2001) "[http://www.cis.upenn.edu/~mkearns/papers/graphgames.pdf Graphical Models for Game Theory]".
| |||