Discretized multinomial distributions and nash equilibria in anonymous games

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

Volumn , Issue , 2008, Pages 25-34

  Daskalakis, Constantinos ^a   Papadimitriou, Christos H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SCHEMES; EUCLIDEAN SPACES; FIXED NUMBERS; MULTINOMIAL DISTRIBUTIONS; NASH EQUILIBRIUMS; TOTAL VARIATIONS; UNIT VECTORS; VARIATIONAL DISTANCES;

COMPUTERS; FIBER OPTIC CHEMICAL SENSORS; GAME THEORY; IMAGE SEGMENTATION; POLYNOMIAL APPROXIMATION; PROBABILITY; PROBABILITY DISTRIBUTIONS; TELECOMMUNICATION NETWORKS;

VECTORS;

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

References (39)

1. T. Abbott, D. Kane and P. Valiant. On the Complexity of Two-Player Win-Lose Games. FOCS 2005.
2. A. D. Barbour. Multivariate Poisson-binomial approximation using Stein's method. In A. D. Barbour and L. H. Y. Chen, editors, Lecture Notes Series No. 5, Institute for Mathematical Sciences, National University of Singapore, 2005.
3. A. D. Barbour and L. H. Y. Chen. An Introduction to Stein's Method. In A. D. Barbour and L. H. Y. Chen (editors), Lecture Notes Series No. 4, Institute for Mathematical Sciences, National University of Singapore, Singapore University Press and World Scientific, 2005.
4. A. D. Barbour, L. Hoist and S. Janson. Poisson Approximation. Oxford University Press, New York, 1992.
5. A. D. Barbour and T. Lindvall. Translated Poisson Approximation for Markov Chains. Journal of Theoretical Probability, 19(3), July 2006.
6. R. N. Bhattaeharya. On Errors of Normal Approximation. The Annals of Probability, 3(5): 815-828, 1975.
7. M. Blonski. Anonymous Games with Binary Actions. Games and Economic Behavior, 28(2): 171-180, 1999.
8. M. Blonski. The women of Cairo: Equilibria in Large Anonymous Games. Journal of Mathematical Economics, 41(3): 253-264, 2005.
9. C. Borgs, J. Chayes, N. Immorlica, A. T. Kalai, V. Mirrokni and C. H. Papadimitriou. The Myth of the Folk Theorem. STOC 2008.
10. H. Bosse, J. Byrka and E. Markakis. New Algorithms for Approximate Nash Equilibria in Bimatrix Games. WINE 2007.
11. X. Chen and X. Deng. Settling the Complexity of Two-Player Nash Equilibrium. FOCS 2006.
12. X. Chen, X. Deng and S. Teng. Computing Nash Equilibria: Approximation and Smoothed Complexity. FOCS 2006.
13. S. Chien and A. Sinclair. Convergence to Approximate Nash Equilibria in Congestion Games. SODA 2007.
14. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley 2006.
15. C. Daskalakis. An Efficient PTAS for Two-Strategy Anonymous Games. Manuscript 2008.
16. C. Daskalakis and C. H. Papadimitriou. Computing Equilibria in Anonymous Games. FOCS' 2007.
17. C. Daskalakis and C. H. Papadimitriou. Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games. ArXiv 2008.
18. C. Daskalakis and C. H. Papadimitriou. On Oblivious PTAS for Nash Equilibrium. Manuscript 2008.
19. C. Daskalakis, P. W. Goldberg and C. H. Papadimitriou. The Complexity of Computing a Nash Equilibrium. STOC 2006.
20. C. Daskalakis, A. Mehta and C. H. Papadimitriou. A Note on Approximate Nash Equilibria. WINE 2006.
21. C. Daskalakis, A. Mehta and C. H. Papadimitriou. Progress in Approximate Nash Equilibria. EC 2007.
22. C. Daskalakis and C. Papadimitriou. Computing Pure Nash Equilibria via Markov Random Fields. EC 2006.
23. E. Elkind, L. A. Goldberg and P. W. Goldberg. Nash Equilibria in Graphical Games on Trees Revisited. EC 2006.
24. T. Feder, H. Nazerzadeh and A. Saberi. Approximating Nash Equilibria Using Small-Support Strategies. EC 2007.
25. 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.
26. F. Götze. On the Rate of Convergence in the Multivariate CLT. The Annals of Probability, 19(2): 724-739, 1991.
27. P. W. Goldberg and C. H. Papadimitriou. Reducibility Among Equilibrium Problems. STOC 2006.
28. R. Kannan and T. Theobald. Games of Fixed Rank: A Hierarchy of Bimatrix Games. SODA 2007.
29. M. Kearns, M. Littman and S. Singh. Graphical Models for Game Theory. UAI 2001.
30. M. Kearns, M. Littman and S. Singh. An Efficient Exact Algorithm for Singly Connected Graphical Games. NIPS 2001.
31. S. C. Kontogiannis, P. N. Panagopoulou and P. G. Spirakis. Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games. WINE 2006.
32. R. Lipton, E. Markakis and A. Mehta. Playing Large Games Using Simple Strategies. EC 2003.
33. J. Nash. Noncooperative Games. Annals of Mathematics, 54:289-295, 1951.
34. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1944.
35. C. H. Papadimitriou and T. Roughgarden. Computing Equilibria in Multi-Player Games. SODA 2005.
36. C. H. Papadimitriou. Computing Correlated Equilibria in Multiplayer Games. STOC 2005.
37. A. Röllin. Translated Poisson Approximation Using Exchangeable Pair Couplings. Annals of Applied Probability, 17:1596-1614, 2007.
38. B. Roos. Metric Multivariate Poisson Approximation of the Generalized Multinomial Distribution. Theory of Probability and its Applications, 43(2), 306-315, 1998.
39. H. Tsaknakis and P. G. Spirakis. An Optimization Approach for Approximate Nash Equilibria . WINE 2007.