On the computational complexity of Nash equilibria for (0, 1) bimatrix games

Authors:
Bruno Codenotti;Daniel Štefankovič
Affiliations:
Toyota Technological Institute at Chicago, Chicago, IL;Department of Computer Science, The University of Chicago, Chicago, IL and Department of Computer Science, Comenius University, Bratislava, Slovakia
Venue:
Information Processing Letters
Year:
2005

Citing 4
Cited 5

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
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Playing large games using simple strategies

Proceedings of the 4th ACM conference on Electronic commerce
Complexity results about Nash equilibria

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Leontief economies encode nonzero sum two-player games

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of uniform Nash equilibria and related regular subgraph problems

Theoretical Computer Science
Note: On the complexity of deciding bimatrix games similarity

Theoretical Computer Science
On the complexity of Nash equilibria of action-graph games

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A continuation method for Nash equilibria in structured games

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix game is an important open question. We put forward the notion of (0,1)-bimatrix games, and show that some associated computational problems are as hard as in the general case.