On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix

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.