A note on approximate Nash equilibria

Theoretical Computer Science

Volumn 410, Issue 17, 2009, Pages 1581-1588

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

^a UNIVERSITY OF CALIFORNIA   (United States)

^b GOOGLE INC   (United States)

Author keywords

Approximation; Nash equilibrium

Indexed keywords

ALGEBRA; BLOOD VESSEL PROSTHESES; CLUSTERING ALGORITHMS; ELECTRIC CONDUCTIVITY MEASUREMENT; GAME THEORY; TELECOMMUNICATION NETWORKS;

APPROXIMATION; APPROXIMATION SCHEMES; BIMATRIX GAMES; CONVEX COMBINATIONS; EFFICIENT ALGORITHMS; GRAPH-THEORETIC; IMPOSSIBILITY RESULTS; LINEAR-TIME ALGORITHMS; MIXED STRATEGIES; NASH EQUILIBRIUM; RANDOMIZED STRATEGIES; SPARSE APPROXIMATIONS;

APPROXIMATION ALGORITHMS;

EID: 61749100561     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.12.031     Document Type: Article

References (23)

1. Althöfer I. On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications (1994) 199
2. Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis, New algorithms for approximate Nash equilibria in bimatrix games, in: WINE, 2007
3. Xi Chen, Xiaotie Deng, Settling the complexity of two-player Nash equilibrium, in: FOCS, 2006
4. Xi Chen, Xiaotie Deng, Shang-Hua Teng, Sparse games are hard, in: WINE, 2006
5. Caccetta L., and Häggkvist R. On minimal digraphs with given girth. Congressus Numerantium XXI (1978)
6. Pierre Charbit, Circuits in graphs and digraphs via embeddings, Doctoral Dissertation, University of Lyon I, 2005
7. Dantzig G.B. Linear Programming and Extensions (1963), Princeton University Press
8. Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou, The complexity of computing a Nash equilibrium, SIAM Journal on Computing (in press) Preliminary version appeared in STOC (2006)
9. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou, A note on approximate Nash equilibria, in: WINE, 2006
10. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou, Progress in approximate Nash equilibria, in: EC, 2007
11. Constantinos Daskalakis, Christos H. Papadimitriou, On oblivious PTAS for Nash equilibrium, Manuscript, 2008
12. Tomás Feder, Hamid Nazerzadeh, Amin Saberi, Approximating Nash equilibria using small-support strategies, in: EC, 2007
13. Paul W. Goldberg, Christos H. Papadimitriou, Reducibility among equilibrium problems, in: STOC, 2006
14. Khachiyan L.G. A polynomial algorithm in linear programming. Soviet Mathematics Doklady 20 1 (1979) 191-194
15. Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis, Polynomial algorithms for approximating Nash equilibria of bimatrix games, in: WINE, 2006
16. Spyros Kontogiannis, Paul G. Spirakis, Efficient algorithms for constant well supported approximate equilibria in bimatrix games, in: ICALP, 2007
17. Ravi Kannan, Thorsten Theobald, Games of fixed rank: A hierarchy of bimatrix games, in: SODA, 2007
18. Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Playing large games using simple strategies, in: EC, 2003
19. Richard J. Lipton, Neal E. Young, Simple strategies for large zero-sum games with applications to complexity theory, in: STOC, 1994
20. Joseph S. Myers, Extremal theory of graph minors and directed graphs, Doctoral Dissertation, University of Cambridge, 2003
21. Scarf H.E. The approximation of fixed points of a continuous mapping. SIAM Journal on Applied Mathematics 15 5 (1967) 1328-1343
22. Haralampos Tsaknakis, Paul G. Spirakis, An optimization approach for approximate Nash equilibria, in: WINE, 2007
23. Neumann J.v. Zur Theorie der Gesellshaftsspiele. Mathematische Annalen 100 (1928) 295-320