The complexity of decision problems about nash equilibria in win-lose games
Date
2012Author
Bilò, VittorioMavronicolas, Marios
ISSN
0302-9743Source
5th International Symposium on Algorithmic Game Theory, SAGT 2012Volume
7615 LNCSPages
37-48Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
We revisit the complexity of deciding, given a (finite) strategic game, whether Nash equilibria with certain natural properties exist such decision problems are well-known to be NP-complete [2, 6, 10] . We show that this complexity remains unchanged when all utilities are restricted to be 0 or 1 thus, win-lose games are as complex as general games with respect to such decision problems. © 2012 Springer-Verlag.