On the Complexity of Deciding Degeneracy in Games
Computer Science and Game Theory
2009-05-20 v1 Computational Complexity
Authors:
Ye Du
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.
Cite
@article{arxiv.0905.3012,
title = {On the Complexity of Deciding Degeneracy in Games},
author = {Ye Du},
journal= {arXiv preprint arXiv:0905.3012},
year = {2009}
}
Related papers
View all related →
Computational Complexity · Computer Science
On the computational complexity of evolution
Ioannis Avramopoulos
2015-06-16
Computer Science and Game Theory · Computer Science
NP-hardness of Computing Uniform Nash Equilibria on Planar Bimatrix Games
Takashi Ishizuka, Naoyuki Kamiyama
2022-08-23
Computer Science and Game Theory · Computer Science
On Iterated Dominance, Matrix Elimination, and Matched Paths
Felix Brandt, Felix Fischer, Markus Holzer
2015-02-06
Computer Science and Game Theory · Computer Science
On Potential Equations of Finite Games
Xinyun Liu, Jiandong Zhu
2015-04-29
Computational Complexity · Computer Science
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games
Vittorio Bilò, Marios Mavronicolas
2019-07-25
Computer Science and Game Theory · Computer Science
Efficient Decomposition of Bimatrix Games
Xiang Jiang, Arno Pauly
2013-01-01
Computer Science and Game Theory · Computer Science
Efficient Decomposition of Bimatrix Games (Extended Abstract)
Xiang Jiang, Arno Pauly
2014-04-04
Computer Science and Game Theory · Computer Science
Enumerating the Nash equilibria of rank 1-games
Thorsten Theobald
2007-09-11
Computer Science and Game Theory · Computer Science
The Empirical Implications of Rank in Bimatrix Games
Siddharth Barman, Umang Bhaskar, Federico Echenique, Adam Wierman
2013-05-16
Computer Science and Game Theory · Computer Science
Constant Rank Bimatrix Games are PPAD-hard
Ruta Mehta
2014-03-25
Computer Science and Game Theory · Computer Science
Finding Nash Equilibria of Two-Player Games
Bernhard von Stengel
2021-02-10
Computer Science and Game Theory · Computer Science
Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners)
Markus Brill, Rupert Freeman, Vincent Conitzer
2021-04-30
Computational Complexity · Computer Science
Backgammon is Hard
R. Teal Witter
2021-12-15
Computational Complexity · Computer Science
Partitionability to two trees is NP-complete
Domotor Palvolgyi
2010-02-23
Computer Science and Game Theory · Computer Science
The Complexity of Testing Properties of Simple Games
Josep Freixas, Xavier Molinero, Martin Olsen, Maria Serna
2008-03-05
Computer Science and Game Theory · Computer Science
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria
Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
2014-12-03
Optimization and Control · Mathematics
More On Hidden $Z$-Matrices and Linear Complementarity Problem
R. Jana, A. Dutta, A. K. Das
2019-09-24
Computer Science and Game Theory · Computer Science
On the commitment value and commitment optimal strategies in bimatrix games
Stefanos Leonardos, Costis Melolidakis
2016-12-30
Numerical Analysis · Mathematics
Fatal Degeneracy in the Semidefinite Programming Approach to the Decision of Polynomial Inequalities
David Monniaux
2009-02-02
Computer Science and Game Theory · Computer Science
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems
Argyrios Deligkas, Eduard Eiben, Gregory Gutin, Philip R. Neary +1
2023-05-15
Formal Languages and Automata Theory · Computer Science
Diverse Palindromic Factorization is NP-Complete
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Karkkainen +4
2020-12-15
Formal Languages and Automata Theory · Computer Science
Checking History-Determinism is NP-hard for Parity Automata
Keya Prakash
2026-05-28
Discrete Mathematics · Computer Science
P_3-Games
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu +1
2016-08-19
Optimization and Control · Mathematics
Semidefinite network games: multiplayer minimax and complementarity problems
Constantin Ickstadt, Thorsten Theobald, Elias Tsigaridas, Antonios Varvitsiotis
2025-12-17
Computer Science and Game Theory · Computer Science
The Complexity of Admissibility in Omega-Regular Games
Romain Brenguier, Jean-François Raskin, Mathieu Sassolas
2014-01-24