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

DOI10.1016/J.TCS.2012.10.053zbMath1257.68072OpenAlexW1983879235MaRDI QIDQ1939257

Ye Du

Publication date: 4 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.053

zbMATH Keywords

degeneracyNP-completebimatrix gamesparsitycomputational economics

Mathematics Subject Classification ID

2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix