Back to search
On the computational complexity of Nash equilibria for bimatrix games
Data up to Jan 2025
Published2005
Citations35
References11
Total Citations Per Year
Abstract
References (11)
Non-Cooperative Games
1951 • 6,006 citations
Non-cooperative games
1989 • 5,966 citations
Equilibrium Points of Bimatrix Games
1964 • 1,252 citations
Algorithms, games, and the internet
2001 • 1,130 citations
On the complexity of the parity argument and other inefficient proofs of existence
1994 • 809 citations
Playing large games using simple strategies
2003 • 416 citations
Nash and correlated equilibria: Some complexity considerations
1989 • 410 citations
Complexity Results about Nash Equilibria
2002 • 232 citations
Computing equilibria for two-person games
2002 • 212 citations
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
2004 • 108 citations
Equilibrium Points in Bimatrix Games
1958 • 102 citations
Cited By (0)
Loading...