The complexity of games on highly regular graphs

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 71-82

  Daskalakis, Konstantinos ^a   Papadimitriou, Christos H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CORRELATION METHODS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

CORRELATED EQUILIBRIA; D-DIMENSIONAL GRIDS; NASH EQUILIBRIA; REGULAR GRAPHS;

COMPUTATIONAL COMPLEXITY;

EID: 27144556417     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_9     Document Type: Conference Paper

References (16)

1. G. E. Collins "Quantifier elimination for real closed fields by cylindrical algebraic decomposition," Springer Lecture Notes in Computer Science, 33, 1975.
2. A. Fabrikant, C. H. Papadimitriou, K. Talwar "The Complexity of Pure Nash Equilibria," STOC, 2004.
3. L. Fortnow, R. Impagliazzo, V. Kabanets, C. Umans "On the complexity of succinct zero-sum games," IEEE Conference on Computational Complexity, 2005.
4. S. Kakade, M. Kearns, J. Langford, and L. Ortiz "Correlated Equilibria in Graphical Games," ACM Conference on Electronic Commerce, 2003.
5. M. Kearns, M. Littman, S. Singh "Graphical Models for Game Theory," UAI, 2001.
6. H. Lewis, C. H. Papadimitriou "Elements of the Theory of Computation," Prentice-Hall, 1981.
7. R. J. Lipton, E. Markakis "Nash Equilibria via Polynomial Equations," LATIN, 2004.
8. J. Nash "Noncooperative games," Annals of Mathematics, 54, 289-295, 1951.
9. C. H. Papadimitriou "Algorithms, Games, and the Internet," STOC, 2001.
10. C. H. Papadimitriou "Computing correlated equilibria in multiplayer games," STOC, 2005.
11. C. H. Papadimitriou "On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence," J. Comput. Syst. Sci., 48(3), 1994.
12. C. H. Papadimitriou, T. Roughgarden "Computing equilibria in multiplayer games," SODA, 2005.
13. J. Renegar "On the Computational Complexity and Geometry of the First-Order Theory of the Reals, I, II, III," J. Symb. Comput., 13(3), 1992.
14. T. Roughgarden, E. Tardos "How bad is selfish routing?," J. ACM, 49(2), 2002.
15. R. Savani, B. von Stengel "Exponentially many steps for finding a Nash equilibrium in a bimatrix game," FOCS, 2004.
16. http://www.eecs.berkeley.edu/~costis/RegularGames.pdf