On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (11)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
Equilibrium points in n -person games
1950 • 6,864 citations
On the complexity of the parity argument and other inefficient proofs of existence
1994 • 809 citations
The complexity of pure Nash equilibria
2004 • 680 citations
Node-and edge-deletion NP-complete problems
1978 • 457 citations
Nash and correlated equilibria: Some complexity considerations
1989 • 410 citations
Complexity Results about Nash Equilibria
2002 • 232 citations
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
2004 • 108 citations
Simple complexity from imitation games
2009 • 39 citations
On the computational complexity of Nash equilibria for bimatrix games
2005 • 35 citations
Deleted Work
1955 • 0 citations