The complexity of computing a nash equilibrium

SIAM Journal on Computing

Volumn 39, Issue 1, 2009, Pages 195-259

  Daskalakis, Constantinos ^a   Goldberg, Paul W ^b   Papadimitriou, Christos H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Complexity; Game theory; Nash equilibrium; PPAD completeness

Indexed keywords

BROUWER'S FIXED POINT THEOREM; COMPLEXITY; COMPLEXITY CLASS; DIRECTED GRAPHS; GRAPHICAL MODEL; LOGICAL OPERATIONS; NASH EQUILIBRIA; NASH EQUILIBRIUM; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; PPAD-COMPLETENESS; TWO-PLAYER GAMES; UNDERLYING GRAPHS;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; GRAPH THEORY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

GAME THEORY;

EID: 67650118856     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070699652     Document Type: Conference Paper

References (57)

1. T. G. ABBOTT, D. KANE, AND P. VALIANT, On the complexity of two-player win-lose games, in 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2005.
2. P. BEAME, S. COOK, J. EDMONDS, R. IMPAGLIAZZO, AND T. PITASSI, The relative complexity of NP search problems, J. Comput. System Sci., 57 (1998), pp. 13-19.
3. C. BORGS, J. CHAYES, N. IMMORLICA, A. T. KALAI, V. MIRROKNI, AND C. H. PAPADIMITRIOU, The myth of the folk theorem, in 40th ACM Symposium on Theory of Computing (STOC), 2008.
4. H. BOSSE, J. BYRKA, AND E. MARKAKIS, New algorithms for approximate Nash equilibria in bimatrix games, in 3rd International Workshop on Internet and Network Economics (WINE), 2007.
5. V. BUBELIS, On equilibria in finite games, Internat. J. Game Theory, 8 (1979), pp. 65-79.
6. G. J. CHANG, W. KE, D. KUO, D. D. LIU, AND R. K. YEH, On L(d, 1)-labelings of graphs, Discrete Math., 220 (2000), pp. 57-66.
7. X. CHEN AND X. DENG, 3-NASH is PPAD-Complete, Technical report TR05-134, Electronic Colloquium on Computational Complexity, 2005.
8. X. CHEN AND X. DENG, Settling the complexity of 2-player Nash-equilibrium, in 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
9. X. CHEN, X. DENG, AND S. TENG, Computing Nash equilibria: Approximation and smoothed complexity, in 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
10. X. CHEN, S. TENG, AND P. VALIANT, The approximation complexity of win-lose games, in 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.
11. B. CODENOTTI, A. SABERI, K. VARADARAJAN, AND Y. YE, Leontief economies encode nonzero sum two-player games, in 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
12. A. CONDON, The complexity of stochastic games, Inform. and Comput., 96 (1992), pp. 203-224.
13. V. CONITZER AND T. SANDHOLM, Complexity results about Nash equilibria, in 18th International Joint Conference on Artificial Intelligence (IJCAI), 2003.
14. G. B. DANTZIG, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
15. C. DASKALAKIS, A. FABRIKANT, AND C. H. PAPADIMITRIOU, The game world is flat: The complexity of Nash equilibria in succinct games, in 33rd International Colloquium on Automata, Languages and Programming (ICALP), 2006.
16. C. DASKALAKIS, P. W. GOLDBERG, AND C. H. PAPADIMITRIOU, The complexity of computing a Nash equilibrium, in 38th ACM Symposium on Theory of Computing (STOC), 2006.
17. C. DASKALAKIS, A. MEHTA, AND C. H. PAPADIMITRIOU, A note on approximate Nash equilibria, in 2nd International Workshop on Internet and Network Economics (WINE), 2006.
18. C. DASKALAKIS, A. MEHTA, AND C. H. PAPADIMITRIOU, Progress in approximate Nash equilibria, in 8th ACM Conference on Electronic Commerce (EC), 2007.
19. C. DASKALAKIS AND C. H. PAPADIMITRIOU, Three-Player Games Are Hard, Technical report TR05-139, Electronic Colloquium on Computational Complexity, 2005.
20. C. DASKALAKIS AND C.H. PAPADIMITRIOU, Computing pure Nash equilibria via Markov random fields, in 7th ACM Conference on Electronic Commerce (EC), 2006.
21. C. DASKALAKIS AND C. H. PAPADIMITRIOU, Computing equilibria in anonymous games, in 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007.
22. C. DASKALAKIS AND C. H. PAPADIMITRIOU, Discretized multinomial distributions and Nash equilibria in anonymous games, in 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2008.
23. B. C. EAVES, Homotopies for computation of fixed points, Math. Program., 3 (1972), pp. 1-22.
24. E. ELKIND, L. A. GOLDBERG, AND P. W. GOLDBERG, Nash equilibria in graphical games on trees revisited, in 7th ACM Conference on Electronic Commerce (EC), 2006.
25. K. ETESSAMI AND M. YANNAKAKIS, On the complexity of Nash equilibria and other fixed points, in 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007.
26. A. FABRIKANT, C. H. PAPADIMITRIOU, AND K. TALWAR, The complexity of pure Nash equilibria, in 36th ACM Symposium on Theory of Computing (STOC), 2004.
27. C. B. GARCIA, C. E. LEMKE, AND H. J. LUTHI, Simplicial approximation of an equilibrium point of noncooperative N-person games, Math. Program., 4 (1973), pp. 227-260.
28. J. GEANAKOPLOS, Nash and Walras equilibrium via Brouwer, Econom. Theory, 21 (2003), pp. 385-603.
29. I. GILBOA AND E. ZEMEL, Nash and correlated equilibria: Some complexity considerations, Games Econom. Behav., 1 (1989), pp. 80-93.
30. P. W. GOLDBERG AND C. H. PAPADIMITRIOU, Reducibility among equilibrium problems, in 38th ACM Symposium on Theory of Computing (STOC), 2006.
31. M. HIRSCH, C. H. PAPADIMITRIOU, AND S. VAVASIS, Exponential lower bounds for finding Brouwer fixed points, J. Complexity, 5 (1989), pp. 379-416.
32. D. S. JOHNSON, C. H. PAPADIMITRIOU, AND M. YANNAKAKIS, HOW easy is local search?, J. Comput. System Sci., 37 (1988), pp. 79-100.
33. M. KEARNS, M. LITTMAN, AND S. SINGH, Graphical models for game theory, in 17th Conference in Uncertainty in Artificial Intelligence (UAI), 2001.
34. L. G. KHACHIYAN, A polynomial algorithm in linear programming, Soviet Math. Dokl., 20 (1979), pp. 191-194.
35. B. KNASTER, C. KURATOWSKI, AND S. MAZURKIEWICZ, Ein Beweis des Fixpunktsatzes für n-dimensionale Simplexe, Fund. Math., 14 (1929), pp. 132-137.
36. G. VAN DER LAAN AND A. J. J. TALMAN, A restart algorithm for computing fixed points without an extra dimension, Math. Program., 17 (1979), pp. 74-84.
37. G. VAN DER LAAN AND A. J. J. TALMAN, On the computation of fixed points in product space of unit simplices and an application to noncooperative N person games, Math. Oper. Res., 7 (1982), pp. 1-13.
38. C. E. LEMKE AND J. T. HOWSON, JR., Equilibrium points of bimatrix games, SIAM J. Appl. Math., 12 (1964), pp. 413-423.
39. R. LIPTON AND E. MARKAKIS, Nash equilibria via polynomial equations, in 6th Latin American Symposium (LATIN), 2004.
40. R. LIPTON, E. MARKAKIS, AND A. MEHTA, Playing large games using simple strategies, in 4th ACM Conference on Electronic Commerce (EC), 2003.
41. M. LITTMAN, M. KEARNS, AND S. SINGH, An efficient, exact algorithm for single connected graphical games, in 15th Annual Conference on Neural Information Processing Systems (NIPS), 2001.
42. N. MEGIDDO AND C.H. PAPADIMITRIOU, On total functions, existence theorems and computational complexity, Theoret. Comput. Sci., 81 (1991), pp. 317-324.
43. J. NASH, Non-cooperative games, Ann. of Math. (2), 54 (1951), pp. 286-295.
44. J. VON NEUMANN, Zur Theorie der Gesellshaftsspiele, Math. Ann., 100 (1928), pp. 295-320.
45. J. VON NEUMANN AND O. MORGENSTERN, Theory of Games and Economic Behavior, Princeton University Press, Princeton, NJ, 1944.
46. M. J. OSBORNE AND A. RUBINSTEIN, A Course in Game Theory, MIT Press, Cambridge, MA, 1994.
47. C. H. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
48. C. H. PAPADIMITRIOU, On the complexity of the parity argument and other inefficient proofs of existence, J. Comput. System Sci., 48 (1994), pp. 498-532.
49. C. H. PAPADIMITRIOU, Computing correlated equilibria in multiplayer games, in 37th ACM Symposium on Theory of Computing (STOC), 2005.
50. C. H. PAPADIMITRIOU AND T. ROUGHGARDEN, Computing equilibria in multi-player games, in 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.
51. J. ROSENMßULLER, On a generalization of the Lemke-Howson algorithm to noncooperative N-person games, SIAM J. Appl. Math., 21 (1971), pp. 73-79.
52. A. RUBINSTEIN, Equilibrium in supergames with the overtaking criterion, J. Econom. Theory, 21 (1979), pp. 1-9.
53. R. SAVANI AND B. VON STENGEL, Exponentially many steps for finding a Nash equilibrium in a bimatrix game, in 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2004.
54. H. SCARF, The approximation of fixed points of a continuous mapping, SIAM J. Appl. Math., 15 (1967), pp. 1328-1343.
55. G. SCHOENEBECK AND S. VADHAN, The computational complexity of Nash equilibria in concisely represented games, in 7th ACM Conference on Electronic Commerce (EC), 2006.
56. H. TSAKNAKIS AND P. G. SPIRAKIS, An optimization approach for approximate Nash equilibria, in 3rd International Workshop on Internet and Network Economics (WINE), 2007.
57. R. WILSON, Computing equilibria of N-person games, SIAM J. Appl. Math., 21 (1971), pp. 80-87.