Recent developments in equilibria algorithms

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

Volumn 3828 LNCS, Issue , 2005, Pages 1-2

  Papadimitriou, Christos ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33744939196     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11600930_1     Document Type: Conference Paper

References (9)

1. P. Beame, S. Cook, J. Edmonds, R. Impagliazzo, T. Pitassi "The Relative Complexity of NP Search Problems," J. Comput. Syst. Sci. 57, 1, pp. 13-19, 1998.
2. C. Daskalakis, P. W. Goldberg and C. H. Papadimitriou "The Complexity of Nash Equilibria," Electronic Colloquium in Computational Complexity, 2005.
3. P. W. Goldberg and C. H. Papadimitriou. "Reducibility Among Equilibrium Problems," Electronic Colloquium in Computational Complexity TR-05-090, 2005.
4. M. Hirsch, C. H. Papadimitriou and S. Vavasis. "Exponential Lower Bounds for Finding Brouwer Fixpoints," J. Complexity 5, pp. 379-416, 1989.
5. M. Kearns, M. Littman and S. Singh. "Graphical Models for Game Theory," Proceedings of UAI, 2001.
6. J. Nash. "Noncooperative Games," Annals of Mathematics, 54, 289-295, 1951.
7. C. H. Papadimitriou. "Computing Correlated Equilibria in Multiplayer Games," Proceedings of STOC, 2005.
8. C. H. Papadimitriou. "On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence," J. Comput. Syst. Sci. 48, 3, pp. 498-532, 1994.
9. R. Savani and B. von Stengel. "Exponentially many steps for finding a Nash equilibrium in a Bimatrix Game". Proceedings of 45th FOCS, pp. 258-267, 2004.