On the Complexity of Deciding Degeneracy in Games
Ye Du
TL;DR
This paper proves that determining whether a bimatrix game is degenerate or nondegenerate is computationally hard, specifically NP-Complete and Co-NP-Complete respectively, highlighting the complexity of analyzing game degeneracy.
Contribution
It establishes the computational complexity classifications for deciding degeneracy in bimatrix games, a fundamental problem in game theory.
Findings
Deciding degeneracy is NP-Complete.
Deciding nondegeneracy is Co-NP-Complete.
Complexity results impact analysis of game solutions.
Abstract
We show that it is NP-Complete to decide whether a bimatrix game is degenerate and it is Co-NP-Complete to decide whether a bimatrix game is nondegenerate.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Game Theory and Voting Systems · Auction Theory and Applications