The complexity of pure Nash equilibria

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 604-612

  Fabrikant, Alex ^a   Papadimitriou, Christos ^a   Talwar, Kunal ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Complexity; Congestion games; Games; Local search; PLS; PLS completeness; Pure Nash equilibria

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

COMPLEXITY; CONGESTION GAMES; GAMES; LOCAL SEARCH; PURE NASH EQUILIBRIA;

GAME THEORY;

EID: 4544358281     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007445     Document Type: Conference Paper

References (27)

1. M. Beckmann, C. McGuire, and C. Winsten. Studies in the Economics of Transportation. Yale University Press, 1956.
2. V. Conitzer and T. Sandholm. Complexity results about nash equilibria. In Proc. of IJCAI, pages 765-771, 2003.
3. S. C. Dafermos and F. T. Sparrow. The traffic assignment problem for a general network, Journal of Research of the National Bureau of Standards, 73(2):91-118, 1969.
4. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker. On a network creation game. In Proc. of ACM PODC, pages 347-351, 2003.
5. L. Fleischer, 2004. Personal Communication.
6. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis. The structure and complexity of nash equilibria for a selfish routing game. In Proc. of ICALP, pages 123-134, 2002.
7. N. Garg and J. Konemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In IEEE Symposium on Foundations of Computer Science, pages 300-309, 1998.
8. A. V. Goldberg and R. E. Tarjan. Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research, 15(3):430-466, 1990.
9. M. D. Grigoriadis and L. G. Khachiyan. Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research, 21:321-340, 1996.
10. D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37:79-100, 1988.
11. A. V. Karzanov and S. T. McCormick. Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM Journal of Computing, 26(4):1245-1275, 1997.
12. M. W. Krentel. Structure in locally optimal solutions. In Proc. of IEEE FOCS, pages 216-221, 1989.
13. R. J. Lipton, E. Markakis, and A. Mehta. Playing large games using simple strategies. In Proc. of ACM E-Commerce, pages 36-41, 2003.
14. I. Milchtaich. Congestion games with player-specific payoff functions. Games and Economic Behavior, 13:111-124, 1996.
15. D. Monderer and L. S. Shapley. Potential games. Games and Economic Behavior, 14:124-143, 1996.
16. J. F. Nash. Equilibrium points in n-person games. In Proc. of National Academy of Sciences, volume 36, pages 48-49, 1950.
17. J. B. Orlin, A. P. Punnen, and A. S. Schulz. Approximate local search in combinatorial optimization. In Proc. of SODA, pages 580-589, 2004.
18. C. H. Papadimitriou. The complexity of the lin-kernighan heuristic for the traveling salesman problem. SIAM Journal on Computing, 21(3):450-465, 1992.
19. C. H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 48(3):498-532, 1994.
20. R. W. Rosenthal. A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
21. T. Roughgarden and E. Tardos. Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior. To appear.
22. T. Roughgarden and É. Tardos. How bad is selfish routing? J. ACM, 49(2):236-259, 2002.
23. R. Savani and B. von Stengel. Long lemke-howson paths. Technical Report LSE-CDAM-2003-14, LSE, 2003.
24. A. A. Schäffer and M. Yannakakis. Simple local search problems that are hard to solve. SIAM Journal on Computing, 20(1):56-87, 1991.
25. A. Vetta. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In Proc. of IEEE FOCS, pages 416-425, 2002.
26. B. von Stengel. Computing equilibria for two-person games. In R. J. Aumann and S. Hart, editors, Handbook of Game Theory, Vol. 3, chapter 45, pages 1723-1759. North-Holland, Amsterdam, 2002.
27. M. Voorneveld, P. Borm, F. van Megen, S. Tijs, and G. Facchini. Congestion games and potentials reconsidered. International Game Theory Review, 1:283-299, 1999.