On the complexity of pure-strategy Nash equilibria in congestion and local-effect games - Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4286 LNCS, Issue , 2006, Pages 62-73

  Dunkel, Juliane ^a   Schulz, Andreas S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION GAMES; EFFECT FUNCTIONS; EXPONENTIAL TIME; EXTENDED ABSTRACTS; INITIAL STATE; MINIMUM COST; NASH EQUILIBRIA; NASH EQUILIBRIUM; NATURAL EXTENSION; NONCOOPERATIVE GAME; NP COMPLETE; SINGLE PATH; STRONGLY NP-HARD; WEIGHTED NETWORKS;

CAVITY RESONATORS; COMPUTATIONAL COMPLEXITY; GAME THEORY; WINE;

INTERNET;

EID: 77049109870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944874_7     Document Type: Conference Paper

References (24)

1. Ackermann, H., H. Röglin, and B. Vöcking (2006a). On the impact of combinatorial structure on congestion games. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, to appear.
2. Ackermann, H., H. Röglin, and B. Vöcking (2006b). Pure Nash equilibria in player-specific and weighted congestion games. This volume.
3. Àlvarez, C., J. Gabarró, and M. Serna (2005). Pure Nash equilibria in games with a large number of actions. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, Gdansk, Poland. Lecture Notes in Computer Science 3618, 95-106.
4. Anshelevich, E., A. Dasgupta, J. Kleinberg, É. Tardos, T. Wexler, and T. Roughgarden (2004). The price of stability for network design with fair cost allocation. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, Rome, Italy, pp. 295-304.
5. Awerbuch, B., Y. Azar, and A. Epstein (2005). The price of routing unsplittable flow. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, pp. 57-66.
6. Brandt, F., F. Fischer, and M. Holzer (2006). Symmetries and the complexity of pure Nash equilibrium. Electronic Colloquium on Computational Complexity TR06-091.
7. Chen, X. and X. Deng (2005). 3-Nash is PPAD-complete. Electronic Colloquium on Computational Complexity TR05-134.
8. Chen, X. and X. Deng (2006). Settling the complexity of 2-player Nash-equilibrium. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, to appear.
9. Daskalakis, C., P. Goldberg, and C. Papadimitriou (2006). The complexity of computing a Nash equilibrium. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, pp. 71-78.
10. Daskalakis, C. and C. Papadimitriou (2005). Three-player games are hard. Electronic Colloquium on Computational Complexity TR05-139.
11. Dunkel, J. (2005). The Complexity of Pure-Strategy Nash Equilibria in Non-Cooperative Games. Diplomarbeit, Institute of Mathematics, Technische Universität Berlin, Germany, July 2005.
12. Fabrikant, A., C. Papadimitriou, and K. Talwar (2004). The complexity of pure Nash equilibria. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, pp. 604-612.
13. Fischer, F., M. Holzer, and S. Katzenbeisser (2006). The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Information Processing Letters 99, 239-245.
14. Fotakis, D., S. Kontogiannis, and P. Spirakis (2005). Selfish unsplittable flows. Theoretical Computer Science 348, 226-239.
15. Goemans, M., V. Mirrokni, and A. Vetta (2005). Sink equilibria and convergence. Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, pp. 142-154.
16. Goldberg, P. and C. Papadimitriou (2006). Reducibility among equilibrium problems. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, pp. 61-70.
17. Gottlob, G., G. Greco, and F. Scarcello (2005). Pure Nash equilibria: Hard and easy games. Journal of Artificial Intelligence Research 24, 357-406.
18. Ieong, S., R. McGrew, E. Nudelman, Y. Shoham, and Q. Sun (2005). Fast and compact: A simple class of congestion games. In Proceedings of the 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, Pittsburgh, PA, 489-494.
19. Leyton-Brown, K. and M. Tennenholtz (2003). Local-effect games. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, 772-780.
20. Milchtaich, I. (1996). Congestion games with player-specific payoff functions. Games and Economic Behavior 13, 111-124.
21. Nash, J. (1951). Non-cooperative games. Annals of Mathematics 54, 268-295.
22. Rosenthal, R. (1973). A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, 65-67.
23. Schäffer, A. and M. Yannakakis (1991). Simple local search problems that are hard to solve. SIAM Journal on Computing 20, 56-87.
24. Schoenebeck, G. and S. Vadhan (2006). The computational complexity of Nash equilibria in concisely represented games. In Proceedings of the 7th ACM Conference on Electronic Commerce, Ann Arbor, MI, pp. 270-279.