The complexity of uniform Nash equilibria and related regular subgraph problems

@article{Bonifaci2008TheCO,
  title={The complexity of uniform Nash equilibria and related regular subgraph problems},
  author={Vincenzo Bonifaci and Ugo Di Iorio and Luigi Laura},
  journal={Theor. Comput. Sci.},
  year={2008},
  volume={401},
  pages={144-152}
}
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 NPcompleteness results for the problems of finding regular induced subgraphs of large size or regularity, which can be of independent interest. © 2008… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Complexity Results about Nash Equilibria

View 4 Excerpts
Highly Influenced

Nash and Correlated Equilibria : Some Complexity Considerations

ITZHAKGILBOAAND EITAN ZEMEL
2003
View 4 Excerpts
Highly Influenced

Papadimitriou . Reducibility among equilibrium problems

H. C.
Proc . 38 th Symp . on Theory of Computing • 2006

Papadimitriou . The complexity of computing a Nash equilibrium

P. W. Goldberg C. Daskalakis, H. C.
Proc . 38 th Symp . on Theory of Computing • 2006

Similar Papers

Loading similar papers…