On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the complexity of the Maximum Subgraph Problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the computational complexity of Nash equilibria for (0, 1) bimatrix games
Information Processing Letters
On the Complexity of Two-PlayerWin-Lose Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Efficient computation of nash equilibria for very sparse win-lose bimatrix games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Fast exponential algorithms for maximum γ-regular induced subgraph problems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
New results on the complexity of uniformly mixed nash equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Network game with attacker and protector entities
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the complexity of uniformly mixed nash equilibria and related regular subgraph problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computing Nash equilibria gets harder: new results show hardness even for parameterized complexity
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Single parameter FPT-algorithms for non-trivial games
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms
| Hi-index | 5.23 |
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose bimatrix games, deciding the existence of such uniform equilibria is an NP-complete problem. Our proof is graph-theoretical. Motivated by this result, we also give NP-completeness results for the problems of finding regular induced subgraphs of large size or regularity, which can be of independent interest.