On the Complexity of Deciding Degeneracy in Games

Simple item page
dc.creatorDu, Ye
dc.date2009-05-19
dc.date.accessioned2026-07-07T13:16:25Z
dc.date.available2026-07-07T13:16:25Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0905.3012
dc.identifierhttp://arxiv.org/abs/0905.3012
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230783
dc.subjectComputer Science and Game Theory
dc.subjectComputational Complexity
dc.titleOn the Complexity of Deciding Degeneracy in Games
dc.typetext

Files

Collections

arXiv