A note on approximate Nash equilibria

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4286 LNCS, Issue , 2006, Pages 297-306

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

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SCHEME; GRAPH-THEORETIC; LINEAR-TIME ALGORITHMS; NASH EQUILIBRIA; NASH EQUILIBRIUM;

CLUSTERING ALGORITHMS; INTERNET; WINE;

APPROXIMATION ALGORITHMS;

EID: 70349159750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944874_27     Document Type: Conference Paper

References (10)

1. [Alt94] I. Althofer. On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications, 199, 1994.
2. [CH78] L. Caccetta and R. Haggkvist. On minimal digraphs with given girth. Congressus Numerantium, XXI, 1978.
3. [Cha05] P. Charbit. Circuits in graphs and digraphs via embeddings. Doctoral dissertation, University of Lyon I, 2005.
4. [CD05] Xi Chen and Xiaotie Deng. Settling the complexity of two-player nash equilibrium. FOCS, 2006.
5. [CDT06] Xi Chen, Xiaotie Deng, and Shang-Hua Teng. Computing nash equilibria: approximation and smoothed complexity. ECCC, 2006.
6. [DGP06] Constantinos Daskalakis, Paul Goldberg, and Christos Papadimitriou. The complexity of computing a nash equilibrium. STOC, 2006.
7. [GP06] Paul Goldberg and Christos Papadimitriou. Reducibility among equilibrium problems. STOC, 2006.
8. [LMM03] Richard Lipton, Evangelos Markakis, and Aranyak Mehta. Playing large games using simple strategies. ACM Electronic Commerce, 2003.
9. [Mye03] J.S. Myers. Extremal theory of graph minors and directed graphs. Doctoral dissertation, 2003.
10. [KPS06] Spyros C. Kontogiannis, Panagiota N. Panagopoulou, and Paul G. Spirakis. Workshop on Internet and Network Economics, WINE, 2006.