On oblivious PTAS's for nash equilibrium

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 75-84

  Daskalakis, Constantinos ^a   Papadimitriou, Christos H ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Anonymous games; Bimatrix games; Nash equilibria; Oblivious algorithms; PTAS

Indexed keywords

ANONYMOUS GAMES; BIMATRIX GAMES; NASH EQUILIBRIA; OBLIVIOUS ALGORITHMS; PTAS;

ALGORITHMS; COMPUTATION THEORY; CONTROL THEORY; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; RANDOM VARIABLES; TELECOMMUNICATION NETWORKS;

SET THEORY;

EID: 70350700908     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536427     Document Type: Conference Paper

References (22)

1. I. Althöfer. On sparse approximations to randomized strategies and convex combinations. Linear Algebra and Applications, 199:339-355, 1994.
2. M. Blonski. Anonymous Games with Binary Actions. Games and Economic Behavior, 28(2): 171-180, 1999.
3. M. Blonski. The women of Cairo: Equilibria in large anonymous games. Journal of Mathematical Economics, 41(3): 253-264, 2005.
4. H. Bosse, J. Byrka and E. Markakis. New Algorithms for Approximate Nash Equilibria in Bimatrix Games. WINE, 2007.
5. X. Chen and X. Deng. Settling the Complexity of Two-Player Nash Equilibrium. FOCS, 2006.
6. X. Chen, X. Deng and S.-H. Teng. Sparse Games Are Hard. WINE, 2006.
7. C. Daskalakis. An Efficient PTAS for Two-Strategy Anonymous Games. WINE, 2008.
8. C. Daskalakis. An Efficient PTAS for Two-Strategy Anonymous Games. ArXiv Report, 2008.
9. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou. The Complexity of Computing a Nash Equilibrium. STOC, 2006.
10. C. Daskalakis, A. Mehta, and C. H. Papadimitriou. A Note on Approximate Nash Equilibria. WINE, 2006.
11. C. Daskalakis, A. Mehta, and C. H. Papadimitriou. Progress in Approximate Nash Equilibria. EC, 2007.
12. C. Daskalakis and C. H. Papadimitriou. Three-Player Games Are Hard. Electronic Colloquium in Computational Complexity, TR05-139, 2005.
13. C. Daskalakis and C. H. Papadimitriou. Computing Equilibria in Anonymous Games. FOCS, 2007.
14. C. Daskalakis and C. H. Papadimitriou. Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games. FOCS, 2008.
15. R. Durrett. Probability: Theory and Examples. Second Edition, Duxbury Press, 1996.
16. P. W. Goldberg and C. H. Papadimitriou. Reducibility Among Equilibrium Problems. STOC, 2006.
17. E. Kalai. Partially-Specified Large Games. WINE, 2005.
18. R. Lipton, E. Markakis, and A. Mehta. Playing Large Games Using Simple Strategies. EC, 2003.
19. I. Milchtaich. Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior, 13:111-124.
20. B. Roos. Binomial Approximation to the Poisson Binomial Distribution: The Krawtchouk Expansion. Theory of Probability and its Applications, 45(2):258-272, 2000.
21. H. Tsaknakis and P. G. Spirakis. An Optimization Approach for Approximate Nash Equilibria. WINE, 2007.
22. V. M. Zolotarev. Random Symmetric Polynomials. Journal of Mathematical Sciences, 38(5):2262-2272, 1987.