Sciweavers

Share
TCS
2008

The complexity of uniform Nash equilibria and related regular subgraph problems

11 years 9 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose bimatrix games, deciding the existence of such uniform equilibria is an NP-complete problem. Our proof is graph-theoretical. Motivated by this result, we also give NP-completeness results for the problems of finding regular induced subgraphs of large size or regularity, which can be of independent interest. Key words: computational complexity, NP-completeness, uniform Nash equilibrium, regular induced subgraph
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TCS
Authors Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
Comments (0)
books