On the Complexity of Deciding Degeneracy in Games
classification
💻 cs.GT
cs.CC
keywords
bimatrixdecidegamewhetherco-np-completecomplexitydecidingdegeneracy
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.