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
Some NP-complete problems in linear programming
Operations Research Letters
Hi-index | 5.23 |
In this paper, we study the problem of deciding degeneracy in a bimatrix game with sparse payoff matrix. We show that it is NP-Complete to decide whether a bimatrix game is degenerate even if its payoff matrix is sparse. However, for a win-lose bimatrix game, it is in P to decide whether it is degenerate.