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. (c) 2008 Elsevier B.V. All rights reserved.
The complexity of uniform Nash equilibria and related regular subgraph problems
Laura L
2008-01-01
Abstract
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. (c) 2008 Elsevier B.V. All rights reserved.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
R11nash_tcs.pdf
non disponibili
Dimensione
728 kB
Formato
Adobe PDF
|
728 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
