Pure nash equilibria in games with a large number of actions

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 95-106

  Àlvarez, Carme ^a   Gabarró, Joaquim ^a   Serna, Maria ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Complexity classes; Nash equilibria; Strategic games

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

COMPLEXITY CLASSES; NASH EQUILIBRIA; POLYNOMIAL PAY-OFF FUNCTIONS; STRATEGIC GAMES;

GAME THEORY;

EID: 26844458787     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_10     Document Type: Conference Paper

References (21)

1. C. Àlvarez, J. Gabarró, and M. Serna. Pure Nash equilibria in games with a large number of actions. Technical Report 31, Electronic Colloquium on Computational Complexity, 2005.
2. J. L. Balcazar, J. Díaz, and J. Gabarró. Structural Complexity II. Springer-Verlag, 1990.
3. J. L. Balcazar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, 2nd. edition, 1995.
4. E. Ben-Porath. The complexity of computing a best response automaton in repeated games with mixed strategies. Games and Economic Behavior, 2(1):1-12, 1990.
5. F. Chu and J. Halpern. On the NP-completeness of finding an optimal strategy in games with commons pay-offs. International Journal of Game Theory, 2001.
6. V. Conitzer and T. Sandholm. Complexity results about Nash equilibra. In IJCAI 2003, pages 765-771, 2003.
7. K. Daskalakis and C. Papadimitriou. The complexity of games on highly regular graphs. Technical report, available at http://www.cs.berkeley.edu/ christos/, 2005.
8. A. Fabrikant, C. Papadimitriou, and K. Talwar. The complexity of pure Nash equilibria. In STOC 2004, pages 604-612, 2004.
9. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis. The structure and complexity of Nash equilibria for a selfish routing game. In ICALP 2002, pages 123-134, 2002.
10. D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish unsplittable flows. In ICALP 2004, pages 593-605, 2004.
11. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, and M. Rode. Nash equilibria in discrete routing games with convex latency functions. In ICALP 2004, pages 645-657, 2004.
12. I. Gilboa and E. Zemel. Nash and correlated equilibria. Games and Economic Behavior, 1(1):80-93, 1989.
13. G. Gottlob, G. Greco, and F. Scarcello. Pure Nash equilibria: Hard and easy games. In Theoretical Aspects of Rationality and Knowledge., pages 215-230, 2003.
14. D. Koller and M. Megiddo. The complexity of two-person zero sum games in extensive form. Games and Economic Behavior, 4(4):528-552, 1992.
15. J. Nash. Non-cooperative games. Annals of Mathematics, pages 286-295., 1951.
16. M.J. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, 1994.
17. C. Papadimitriou. On players with a bounded number of actions. Games and Economic Behavior, 4(1):122-131, 1992.
18. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
19. C. Papadimitriou. Algorithms, games and the internet. In STOC 2001, pages 4-8, 2001.
20. G.R. Schoenebeck and S. Vadham. The complexity of Nash equilibria in concisely represented games. Technical Report 52, Electronic Colloquium on Computational Complexity, 2005.
21. T. Thierauf. The computational complexity of equivalence and isomorphisms problems. Springer, 2000.