Progress in approximate nash equilibria

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

Volumn , Issue , 2007, Pages 355-358

  Daskalakis, Constantinos ^a   Mehta, Aranyak ^b   Papadimitriou, Christos ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Algorithm; Approximate nash; Nash equilibrium

Indexed keywords

2-PLAYER GAMES; NASH EQUILIBRIA; POLYNOMIAL ALGORITHM;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRONIC COMMERCE; POLYNOMIAL APPROXIMATION; PROFESSIONAL ASPECTS;

INFORMATION TECHNOLOGY;

EID: 36448971240     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250910.1250962     Document Type: Conference Paper

References (9)

1. I. Althofer. On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications, 1994.
2. X. Chen and X. Deng. Settling the complexity of two-player nash equilibrium. FOCS, 2006.
3. X. Chen, X. Deng, and S.-H. Teng. Computing nash equilibria: approximation and smoothed complexity. FOCS, 2006.
4. C. Daskalakis, P. Goldberg, and C. Papadimitriou. The complexity of computing a nash equilibrium. STOC, 2006.
5. C. Daskalakis, A. Mehta, and C. Papadimitriou. A note on approximate nash equilibria. WINE, 2006.
6. T. Feder, H. Nazerzadeh, and A. Saberi. Personal communication, 2006.
7. P. Goldberg and C. Papadimitriou. Reducibility among equilibrium problems. STOC, 2006.
8. S. C. Kontogiannis, P. N. Panagopoulou, and P. G. Spirakis. Polynomial algorithms for approximating nash equilibria of bimatrix games. WINE, 2006.
9. R. Lipton, E. Markakis, and A. Mehta. Playing large games using simple strategies. Electronic Commerce, 2003.