On the Complexity of Deciding Degeneracy in Games

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Computer Science and Game Theory, Computational Complexity

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/230783

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0905.3012
 http://arxiv.org/abs/0905.3012

Collections

arXiv