Note: On the complexity of deciding bimatrix games similarity

Authors:
Ye Du
Affiliations:
Department of Electrical Engineering and Computer Science, University of Michigan, 2260 Hayward Ave, Ann Arbor, MI 48109-2121, USA
Venue:
Theoretical Computer Science
Year:
2008

Citing 6
Cited 0

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
On the computational complexity of Nash equilibria for (0, 1) bimatrix games

Information Processing Letters
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
Computing Nash Equilibria: Approximation and Smoothed Complexity

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Complexity results about Nash equilibria

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

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we show that it is NP-complete to decide whether two bimatrix games share a common Nash equilibrium. Furthermore, it is co-NP-hard to decide whether two bimatrix games have exactly the same set of Nash equilibria.