Settling the complexity of computing two-player Nash equilibria

Journal of the ACM

Volumn 56, Issue 3, 2009, Pages

  Chen, Xi ^a   Deng, Xiaotie ^b   Teng, Shang Hua ^c  

^a TSINGHUA UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c BOSTON UNIVERSITY   (United States)

Author keywords

Arrow Debreu market; Brouwer's fixed point; Lemke Howson algorithm; Nash equilibrium; PPAD completeness; Smoothed analysis; Sperner's lemma; Two player game

Indexed keywords

EID: 69349098240     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1516512.1516516     Document Type: Article

References (76)

1. Abbott, T., Kane, D., and Valiant, P. 2005. On the complexity of two-player win-lose games. In FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 113-122.
2. Addario-Berry, L., Olver, N., and Vetta, A. 2007. A polynomial time algorithm for finding Nash equilibria in planar win-lose games. J. Graph Algor. Applica. 11, 1, 309-319.
3. Arrow, K., and Debreu, G. 1954. Existence of an equilibrium for a competitive economy. Econometrica 22, 265-290.
4. Brny, I., Vempala, S., and Vetta, A. 2005. Nash equilibria in random games. In FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 123-131.
5. Blum, L., Shub, M., and Smale, S. 1989. On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines. Bull. AMS 21, 1 (July), 1-46.
6. Borgwardt, K.-H. 1982. The average number of steps required by the simplex method is polynomial. Z. Oper. Res. 26, 157-177.
7. Bosse, H., Byrka, J., and Markakis, E. 2007. New algorithms for approximate Nash equilibria in bimatrix games. In Proceedings of the 3rd International Workshop on Internet and Network Economics. 17-29.
8. Brouwer, L. 1910. ber Abbildung von Mannigfaltigkeiten. Math. Ann. 71, 97-115.
9. Chen, X., and Deng, X. 2005a. 3-Nash is PPAD-complete. In Electronic Colloquium in Computational Complexity. TR05-134.
10. Chen, X., and Deng, X. 2005b. On algorithms for discrete and approximate Brouwer fixed points. In STOC '05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing. ACM, New York, 323-330.
11. Chen, X., and Deng, X. 2006. On the complexity of 2D discrete fixed point problem. In ICALP '06: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming. 489-500.
12. Chen, X., Deng, X., and Teng, S.-H. 2006a. Sparse games are hard. In Proceedings
13. of the 2nd Workshop on Internet and Network Economics. 262-273.
14. Chen, X., Huang, L.-S., and Teng, S.-H. 2006b. Market equilibria with hybrid linear-Leontief utilities. In Proceedings of the 2nd Workshop on Internet and Network Economics. 274-285.
15. Chen, X., Sun, X., and Teng, S.-H. 2008. Quantum separation of local search and fixed point computation. In Proceedings of the 14th Annual International Computing and Combinatorics Conference. 169-178.
16. Chen, X., and Teng, S.-H. 2007. Paths beyond local search: A tight bound for randomized fixed-point computation. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 124-134.
17. Chen, X., Teng, S.-H., and Valiant, P. 2007. The approximation complexity of win-lose games. In SODA '07: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms.
18. ACM, New York, 159-168.
19. Codenotti, B., Saberi, A., Varadarajan, K., and Ye, Y. 2006. Leontief economies encode nonzero sum two-player games. In SODA '06: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 659-667.
20. Condon, A., Edelsbrunner, H., Emerson, E., Fortnow, L., Haber, S., Karp, R., Leivant, D., Lipton, R., Lynch, N., Parberry, I., Papadimitriou, C., Rabin, M., Rosenberg, A., Royer, J., Savage, J., Selman, A., Smith, C., Tardos, E., and Vitter, J. 1999. Challenges for theory of computing: Report of an NSF-sponsored workshop on research in theoretical computer science. SIGACT News 30, 2, 62-76.
21. Conitzer, V., and Sandholm, T. 2003. Complexity results about Nash equilibria. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). ACM, New York, 765-771.
22. Daskalakis, C., Goldberg, P., and Papadimitriou, C. 2006a. The complexity of computing a Nash equilibrium. In STOC '06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 71-78.
23. Daskalakis, C., Goldberg, P., and Papadimitriou, C. H. 2009. The complexity of computing a Nash equilibrium. SIAM J. Comput. To appear.
24. Daskalakis, C., Mehta, A., and Papadimitriou, C. H. 2006b. A note on approximate Nash equilibria. In Proceedings of the 2nd Workshop on Internet and Network Economics. 297-306.
25. Daskalakis, C., Mehta, A., and Papadimitriou, C. 2007. Progress in approximate Nash equilibria. In Proceedings of the 8th ACM Conference on Electronic Commerce. ACM, New York, 355-358.
26. Daskalakis, C., and Papadimitriou, C. 2005. Three-player games are hard. In Electronic Colloquium in Computational Complexity. TR05-139.
27. Deng, X., Papadimitriou, C., and Safra, S. 2003. On the complexity of price equilibria. J. Comput. Syst. Sci. 67, 2, 311-324.
28. Edelsbrunner, H. 2006. Geometry and Topology for Mesh Generation (Cambridge Monographs on Applied and Computational Mathematics). Cambridge University Press, New York.
29. Etessami, K., and Yannakakis, M. 2007. On the complexity of Nash equilibria and other fixed points. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 113-123.
30. Feder, T., Nazerzadeh, H., and Saberi, A. 2007. Approximating Nash equilibria using small-support strategies. In Proceedings of the 8th ACM Conference on Electronic Commerce. ACM, New York, 352-354.
31. Friedl, K., Ivanyos, G., Santha, M., and Verhoeven, F. 2005. On the black-box complexity of Sperner's lemma. In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory. 245-257.
32. Friedl, K., Ivanyos, G., Santha, M., and Verhoeven, F. 2006. Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes. In Proceedings of the 6th Conference on Algorithms and Complexity. 380-391.
33. Gilboa, I., and Zemel, E. 1989. Nash and correlated equilibria: Some complexity considerations. Games Econ. Behav. 1, 1, 80-93.
34. Goldberg, P., and Papadimitriou, C. 2006. Reducibility among equilibrium problems. In STOC '06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, New York, 61-70.
35. Haxell, P. E., and Wilfong, G. T. 2008. A fractional model of the border gateway protocol (BPG). In SODA '08: Proceedings of the 19th annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 193-199.
36. Hirsch, M., Papadimitriou, C., and Vavasis, S. 1989. Exponential lower bounds for finding Brouwer fixed points. J. Complex. 5, 379-416.
37. Holt, C., and Roth, A. 2004. The Nash equilibrium: A perspective. Proc. Nat. Acad. Sci. USA 101, 12, 3999-4002.
38. Huang, L.-S., and Teng, S.-H. 2007. On the approximation and smoothed complexity of Leontief market equilibria. In Proceedings of the 1st International Frontiers of Algorithmics Workshop. 96-107.
39. Johnson, D. 2007. The NP-completeness column: Finding needles in haystacks. ACM Trans. Algor. 3, 2, 24.
40. Kakutani, S. 1941. A generalization of Brouwer's fixed point theorem. Duke Math. J. 8, 457-459.
41. Kannan, R., and Theobald, T. 2007. Games of fixed rank: A hierarchy of bimatrix games. In SODA '07: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 1124-1132.
42. Karmarkar, N. 1984. A new polynomial-time algorithm for linear programming.Combinatorica 4, 373-395.
43. Kearns, M., Littman, M., and Singh, S. 2001. Graphical models for game theory. In Proceedings of the Conference on Uncertainty in Artificial Intelligence. 253-260.
44. Khachian, L. 1979. A polynomial algorithm in linear programming. Doklady Akademia Nauk SSSR 244, 1093-1096, (English translation in Soviet Math. Dokl. 20, 191-194).
45. Klee, V., and Minty, G. 1972. How good is the simplex algorithm? In Inequalities - III, O. Shisha, Ed. Academic Press, Orlando, FL, 159-175.
46. Ko, K. 1991. Complexity Theory of Real Functions. Birkhauser Boston Inc., Cambridge, MA.
47. Kontogiannis, S., Panagopoulou, P., and Spirakis, P. 2006. Polynomial algorithms for approximating Nash equilibria of bimatrix games. In Proceedings of the 2nd Workshop on Internet and Network Economics. 286-296.
48. Laoutaris, N., Poplawski, L. J., Rajaraman, R., Sundaram, R., and Teng, S.-H. 2008. Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. In PODC '08: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing. ACM, New York, 165-174.
49. Lemke, C. 1965. Bimatrix equilibrium points and mathematical programming.
50. Manag. Sci. 11, 681-689.
51. Lemke, C., and Howson, Jr., J. 1964. Equilibrium points of bimatrix games. J. Soc. Indust. Appl. Math. 12, 413-423.
52. Leonard, R. 1994. Reading Cournot, reading Nash: The creation and stabilisation of the Nash equilibrium. Economic Journal 104, 424, 492-511.
53. Lipton, R., and Markakis, E. 2004. Nash equilibria via polynomial equations. In Proceedings of the 6th Latin American Symposium on Theoretical Informatics. 413-422.
54. Lipton, R., Markakis, E., and Mehta, A. 2004. Playing large games using simple strategies. In Proceedings of the 4th ACM Conference on Electronic Commerce. ACM, New York, 36-41.
55. Megiddo, N. 1988. A note on the complexity of P-matrix LCP and computing an equilibrium. Res. Rep. RJ6439 IBM Almaden Research Center, San Jose.
56. Megiddo, N., and Papadimitriou, C. 1991. On total functions, existence theorems and
57. computational complexity. Theoretical Computer Science 81, 317-324.
58. Morgenstern, O., and von Neumann, J. 1947. Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ.
59. Nash, J. 1950. Equilibrium points in n-person games. Proc. Nat. Acad. USA 36, 1, 48-49.
60. Nash, J. 1951. Noncooperative games. Ann. Math. 54, 289-295.
61. Papadimitriou, C. 1991. On inefficient proofs of existence and complexity classes. In Proceedings of the 4th Czechoslovakian Symposium on Combinatorics.
62. Papadimitriou, C. 1994. On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci., 498-532.
63. Papadimitriou, C. 2001. Algorithms, games, and the internet. In STOC '01: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. ACM, New York, 749-753.
64. Poplawski, L. J., Rajaraman, R., Sundaram, R., and Teng, S.-H. 2008. Preference games and personalized equilibria, with applications to fractional BGP. In arXiv:0812.0598.
65. Sandholm, T. 2000. Issues in computational Vickrey auctions. Int. J. Electron.
66. Comm. 4, 3, 107-129.
67. Savani, R., and von Stengel, B. 2004. Exponentially many steps for finding a Nash equilibrium in a bimatrix game. In FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 258-267.
68. Scarf, H. 1967a. The approximation of fixed points of a continuous mapping. SIAM J. Appl. Math. 15, 997-1007.
69. Scarf, H. 1967b. On the computation of equilibrium prices. In Ten Economic Studies in the Tradition of Irving Fisher, W. Fellner, Ed. Wiley, New York.
70. Sperner, E. 1928. Neuer Beweis fur die Invarianz der Dimensionszahl und des Gebietes. Abhandlungen aus dem Mathematischen Seminar Universitat Hamburg 6, 265-272.
71. Spielman, D., and Teng, S.-H. 2004. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51, 3, 385-463.
72. Spielman, D., and Teng, S.-H. 2006. Smoothed analysis of algorithms and heuristics: Progress and open questions. In Foundations of Computational Mathematics, L. Pardo, A. Pinkus, E. Suli, and M. Todd, Eds. Cambridge University Press, Cambridge, MA, 274-342.
73. Tsaknakis, H., and Spirakis, P. 2007. An optimization approach for approximate Nash equilibria. In Proceedings of the 3rd International Workshop on Internet and Network Economics. 42-56.
74. von Neumann, J. 1928. Zur theorie der gesellschaftsspiele. Math. Ann. 100, 295-320.
75. Wilson, R. 1971. Computing equilibria of n-person games. SIAM J. Appl. Math. 21, 80-87.
76. Ye, Y. 2005. Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality. In Proceedings of the 1st Workshop on Internet and Network Economics. 14-23.