arXiv
Open Access
2009
On the Complexity of Deciding Degeneracy in Games
Ye Du
Abstrak
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.
Penulis (1)
Y
Ye Du
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2009
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓