Computing equilibria in anonymous games

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 83-93

  Daskalakis, Constantinos ^a   Papadimitriou, Christos ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING EQUILIBRIUM; EFFICIENT APPROXIMATION ALGORITHMS; GAMES WITH MANY PLAYERS; NASH EQUILIBRIUM (NE); POLYNOMIAL-TIME;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; GAME THEORY; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 46749115174     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389482     Document Type: Conference Paper

References (27)

1. T. Abbott, D. Kane, P. Valiant. On the Complexity of Two-Player Win-Lose Games. FOCS, 2005.
2. A. D. Barbour, L. Hoist and S. Janson. Poisson Approximation. Oxford University Press, New York, 1992.
3. A. D. Barbour and T. Lindvall. Translated Poisson Approximation for Markov Chains. Journal of Theoretical Probability, 19(3), July 2006.
4. M. Blonski. Characterization of Equilibria in Large Anonymous Games. University of Mannheim, 2000.
5. M. Blonski. Equilibrium Characterization in Large Anonymous Games. University of Mannheim, 2001.
6. X. Chen and X. Deng. Settling the Complexity of Two-Player Nash Equilibrium. FOCS, 2006.
7. X. Chen, X. Deng, and S.-H. Teng. Computing Nash Equilibria: Approximation and Smoothed Complexity. FOCS, 2006.
8. S. Chien and A. Sinclair. Convergence to Approximate Nash Equilibria in Congestion Games. SODA, 2007.
9. C. Daskalakis, and C. Papadimitriou. Computing Equilibria in Anonymous Games. arXiv report, 2007.
10. C. Daskalakis, P. Goldberg, and C. Papadimitriou. The Complexity of Computing a Nash Equilibrium. STOC, 2006.
11. C. Daskalakis, A. Mehta, and C. Papadimitriou. A Note on Approximate Nash Equilibria. WINE, 2006.
12. C. Daskalakis, A. Mehta, and C. Papadimitriou. Progress in Approximate Nash Equilibria. EC, 2007.
13. A. Fabrikant, C. H. Papadimitriou and K. Talwar. The Complexity of Pure Nash Equilibria. STOC, 2004.
14. T. Feder, H. Nazerzadeh, and A. Saberi. Approximating Nash Equilibria Using Small-Support Strategies. EC, 2007.
15. D. Gale, H. W. Kuhn, and A. W. Tucker. On Symmetric Games. In H. W. Kuhn and A. W. Tucker, editors, Contributions to the Theory of Games, 1:81-87, Princeton University Press, 1950.
16. P. Goldberg and C. Papadimitriou. Reducibility Among Equilibrium Problems. STOC, 2006.
17. E. Kalai. Partially-Specified Large Games. WINE, 2005.
18. R. Kannan and T. Theobald. Games of Fixed Rank: A Hierarchy of Bimatrix Games. SODA, 2007.
19. S. C. Kontogiannis, P. N. Panagopoulou, and P. G. Spirakis. Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. WINE, 2006.
20. R. Lipton, E. Markakis, and A. Mehta. Playing Large Games Using Simple Strategies. EC, 2003.
21. I. Milchtaich. Congestion Games with PlayerSpecific Payoff Functions. Games and Economic Behavior, 13(1):111-124, 1996.
22. J. Nash. Noncooperative Games. Annals of Mathematics, 54:289-295, 1951.
23. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1944.
24. C. H. Papadimitriou and T. Roughgarden. Computing Equilibria in Multi-Player Games. SODA, 2005.
25. C. H. Papadimitriou. Computing Correlated Equilibria in Multiplayer Games. STOC, 2005.
26. A. Röllin. Translated Poisson Approximation Using Exchangeable Pair Couplings. arXiv Report, 2006.
27. B. Roos. Multinomial and Krawtchouk Approximations to the Generalized Multinomial Distribution. Theory of Probability and Its Applications, 46(1):103-117, 2001.