On the complexity of pure-strategy nash equilibria in congestion and local-effect games

Mathematics of Operations Research

Volumn 33, Issue 4, 2008, Pages 851-868

  Dunkel, Juliane ^a   Schulz, Andreas S ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computational complexity; Congestion games; Local effect games; Noncooperative games; Pure strategy nash equilibria

Indexed keywords

COMPLEXITY RESULTS; CONGESTION GAMES; FIXED NUMBERS; LOCAL-EFFECT GAMES; NATURAL EXTENSIONS; NONCOOPERATIVE GAMES; PURE-STRATEGY NASH EQUILIBRIA; SINGLE PATHS; STRONGLY NP-HARD; WEIGHTED NETWORKS;

CAVITY RESONATORS; COMPUTATIONAL COMPLEXITY; TELECOMMUNICATION NETWORKS;

GAME THEORY;

EID: 61449248100     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0322     Document Type: Article

References (36)

1. Ackermann, H., H. Röglin, B. Vöcking. 2006a. On the impact of combinatorial structure on congestion games. Proc. 47th Ann. IEEE Sympos. Foundations Comput. Sci., Berkeley, CA, 613-622.
2. Ackermann, H., H. Röglin, B. Vöcking. 2006b. Pure Nash equilibria in player-specific and weighted congestion games. P. G. Spirakis, M. Mavronicolas, S. C. Kontogiannis, eds. Proc. 2nd Internat. Workshop on Internet and Network Econom. Lecture Notes in Computer-Science, Vol. 4286. Springer, Berlin, 50-61.
3. Aland, S., D. Dumrauf, M. Gairing, B. Monien, F. Schoppmann. 2006. Exact price of anarchy for polynomial congestion games. B. Durand, W. Thomas, eds. Pmc. 23rd Internat. Sympos. Theoretical Aspects of Comput. Sci. Lecture Notes in Computer Science, Vol. 3884. Springer, Berlin, 218-229.
4. Alvarez, C, J. Gabarro, M. J. Serna. 2005. Pure Nash equilibria in games with a large number of actions. J. Jedrzejowicz, A. Szepietowski, eds. Pmc. 30th Internat. Sympos. Math. Foundations of Comput. Sci. Lecture Notes in Computer Science, Vol. 3618. Springer, Berlin, 95-106.
5. Awerbuch, B., Y. Azar, A. Epstein. 2005. The price of routing unsplittable flow. Proc. 37th Annual ACM Sympos. Theory Comput, Baltimore, 57-66.
6. Brandt, F., F. Fischer, M. Hölzer. 2007. Symmetries and the complexity of pure Nash equilibrium. W. Thomas, P. Weil, eds. Proc. 24th Internat. Sympos. Theoretical Aspects Comput. Sci. Lecture Notes in Computer Science, Vol. 4393. Springer, Berlin, 212-223.
7. Chen, X., X. Deng. 2005. 3-Nash is PPAD-complete. Technical Report 05-134, Electronic Colloquium in Computational Complexity.
8. Chen, X., X. Deng. 2006. Settling the complexity of two-player Nash equilibrium. Proc. 47th Annual IEEE Sympos. Foundations Comput. Sci., Berkeley, CA, 261-272.
9. Daskalakis, C., C. H. Papadimitriou. 2005. Three-player games are hard. Technical Report 05-139, Electronic Colloquium in Computational Complexity.
10. Daskalakis, C., P. W. Goldberg, C. H. Papadimitriou. 2006. The complexity of computing a Nash equilibrium.. Proc. 38th Annual ACM Sympos. Theory Comput., Seattle, 71-78.
11. Dunkel, J., A. S. Schulz. 2006. On the complexity of pure-strategy Nash equilibria in congestion and local-effect games. P. G. Spirakis, M. Mavronicolas, S. C. Kontogiannis, eds. Proc. 2nd Internat. Workshop on Internet and Network Econom. Lecture Notes in Computer Science, Vol. 4286. Springer, Berlin, 62-73.
12. Fabrikant, A., C. H. Papadimitriou, K. Talwar. 2004. The complexity of pure Nash equilibria. Proc. 36th Annual ACM Sympos. Theory Comput., Chicago, IL, 604-612.
13. Fischer, F., M. Hölzer, S. Katzenbeisser. 2006. The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. Inform. Processing Lett. 99 239-245.
14. Fischer, S. T. 1995. A note on the complexity of local search problems. Inform. Processing Lett. 53(2) 69-75.
15. Fortune, S., J. E. Hopcroft, J. Wyllie. 1980. The directed subgraph homeomorphism problem.. Theoret. Comput. Sci. 10(2) 111-121.
16. Fotakis, D., S. Kontogiannis, P. Spirakis. 2005. Selfish unsplittable flows. Theoret. Comput. Sci. 348(2) 226-239.
17. Gairing, M., B. Monien, K. Tiemann. 2006. Routing (un-) splittable flow in games with player-specific linear latency functions. M. Bugliesi, B. Preneel, V. Sassone, I. Wegener, eds. Proc. 33rd Internat. Colloquium on Automata, Languages and Pmgramming. Lecture Notes in Computer Science, Vol. 4051. Springer, Berlin, 501-512.
18. Garey, M. R., D. S. Johnson. 1979. Computers and Intractibility. A Guide to the Theory of NP-Completeness. Freeman and Company, New York.
19. Goemans, M. X., V. Mirrokni, A. Vetta. 2005. Sink equilibria and convergence. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci., Pittsburgh, 142-154.
20. Goldberg, P. W., C. H. Papadimitriou. 2006. Reducibility among equilibrium problems. Proc. 38th Annual, ACM Sympos. Theory Comput., Seattle, 61-70.
21. Gottlob, G., G. Greco, F. Scarcello. 2005. Pure Nash equilibria: Hard and easy games. J. Artificial Intelligence Res. 24 357-406.
22. Ieong, S., R. McGrew, E. Nudelman, Y. Shoham, Q. Sun. 2005. Fast and compact: A simple class of congestion games. Proc. 20th National Conf. Artificial Intelligence and the 17th Innovative Appl. Artificial Intelligence Conf., Pittsburgh, 489-494.
23. Johnson, D. S., C. H. Papadimitriou, M. Yannakakis. 1988. How easy is local search? J. Comput. System Sci. 37 79-100.
24. Leyton-Brown, K., M. Tennenholtz. 2003. Local-effect games. Proc. 18th Internat. Joint Conf. Artificial Intelligence, Acapulco, Mexico, 772-780.
25. Libman, L., A. Orda. 2001. Atomic resource sharing in noncooperative networks. Telecommunication Systems 17 385-409.
26. Meyers, C. A., A. S. Schulz. 2008. The complexity of congestion games. Working paper, Massachusetts Institute of Technology, Cambridge, MA.
27. Milchtaich, I. 1996. Congestion games with player-specific payoff functions. Games Econom. Behav. 13 111-124.
28. Milchtaich, I. 2006. The equilibrium, existence problem in finite network congestion games. P. G. Spirakis, M. Mavronicolas, S. C. Kontogiannis, eds. Proc. 2nd Internat. Workshop on Internet and Network Econom. Lecture Notes in Computer Science, Vol. 4286. Springer, Berlin, 87-98.
29. Monderer, D., L. S. Shapley. 1996. Potential games. Games Econom. Behav. 14 124-143.
30. Nash, J. F. 1951. Non-cooperative games. Ann. Math. 54 286-295.
31. Rosenthal, R. W. 1973a. A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory 2, 65-67.
32. Rosenthal, R. W. 1973b. The network, equilibrium problem in integers. Networks 3 53-59.
33. Schärfer, A. A., M. Yannakakis. 1991. Simple local search problems that are hard to solve. SIAM J. Comput. 20 56-87.
34. Schoenebeck, G., S. P. Vadhan. 2006. The computational complexity of Nash equilibria in concisely represented games. Proc. 7th ACM Conf. Electronic Commerce, Ann Arbor, MI, 270-279.
35. Shor, M. 2005. Matching pennies. Dictionary of Game Theory Terms, Game Theory .net. http://www.gametheory.net/dictionary/Games/MatchingPennies.html.
36. Yannakakis, M. 1997. Computational complexity. E. Aarts, J. K. Lenstra, eds. Local Search in Combinatorial Optimization, Chapter 2. John Wiley and Sons, New York, 19-55.