The complexity of decision problems about nash equilibria in win-lose games
Source5th International Symposium on Algorithmic Game Theory, SAGT 2012
Google Scholar check
MetadataShow full item record
We revisit the complexity of deciding, given a (finite) strategic game, whether Nash equilibria with certain natural properties existsuch 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 1thus, win-lose games are as complex as general games with respect to such decision problems. © 2012 Springer-Verlag.