294 search results - page 1 / 59 » The complexity of computing a Nash equilibrium |
111
Voted
STOC
2006
ACM
16 years 5 months ago
2006
ACM
124
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
130
click to vote
SOFSEM
2009
Springer
16 years 1 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
156
Voted
STACS
2007
Springer
15 years 11 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...