Approximating nash equilibria using small-support strategies

EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce

Volumn , Issue , 2007, Pages 352-354

  Feder, Tomas ^a   Nazerzadeh, Hamid ^b   Saberi, Amin ^b  

^a Stanford University ^*  (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Nash equilibrium; Probabilistic methods; Small support strategies

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRONIC COMMERCE; PROBABILISTIC LOGICS; PROFESSIONAL ASPECTS;

APPROXIMATING NASH EQUILIBRIA; PROBABILISTIC METHODS; SMALL-SUPPORT STRATEGIES; TWO PLAYER GAMES;

INFORMATION TECHNOLOGY;

EID: 36448949018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250910.1250961     Document Type: Conference Paper

References (8)

1. I. Althöfer. On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications, 199, 1994.
2. X. Chen, X. Deng. Settling the complexity of two-player nash equilibrium. In Proceeding of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
3. X. Chen, X. Deng, and S. Teng. Computing Nash equilibria: approximation and smoothed complexity. In Proceeding of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
4. C. Daskalakis, A. Mehta, C. Papadimitriou. A note on approximate Nash equilibria. In Proceedings of the Second International Workshop on Internet and Network Economics (WINE), 2006.
5. C. Daskalakis, A. Mehta, C. Papadimitriou. Progress in Approximate Nash equilibrium. In Proceedings of 8th ACM Conference on Electronic Commerce (EC), 2007.
6. C. Daskalakis, P. Goldberg, and C. Papadimitriou. The complexity of computing a Nash equilibrium. In Proceedings of the 38th A CM Annual Symposium on Theory of Computing (STOC), 2006.
7. R. Lipton, V. Markakis, A. Mehta. Playing large games using simple strategies. In Proceedings of the 4th Annual ACM Conference on Electronic Commerce (EC), 2003.
8. J. Nash. Non-Cooperative Games. The Annals of Mathematics, 54(2):286-295, 1950.