Computing equilibria in multi-player games

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 82-91

  Papadimitriou, Christos H ^a   Roughgarden, Tim ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY THEORY; COMPUTING EQUILIBRIA; MULTI-PLAYER GAMES; NASH EQUILIBRIUM;

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; INTERNET; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS;

GAME THEORY;

EID: 20744453823     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (40)

1. R. J. Aumann. Subjectivity and correlation in randomized strategies. Journal of Mathematical Economics, 1(1):67-96, 1974.
2. R. J. Aumann. Correlated equilibrium as an expression of Bayesian rationality. Econometrica, 55(1):1-18, 1987.
3. J. W. Brown and J. von Neumann. Solutions of games by differential equations. In H. W. Kuhn and A. W. Tucker, editors, Contributions to the Theory Games, volume 1, pages 73-79. Princeton University Press, 1950.
4. V. Chvátal. Linear Programming. Freeman, 1983.
5. V. Conitzer and T. Sandholm. Complexity results about Nash equilibria. In Proceedings of International Joint Conference on Artificial Intelligence, 2003.
6. A. Czumaj. Selfish routing on the Internet. In J. Leung, editor, Handbook of Scheduling. CRC Press, Boca Raton, PL, 2004, to appear.
7. X. Deng, C. H. Papadimitriou, and S. Safra. On the complexity of equilibria. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pages 67-71, 2002.
8. N. R. Devanur, C. H. Papadimitriou, A. Saberi, and V. V. Vazirani. Market equilibrium via a primaldual-type algorithm. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, pages 389-395, 2002.
9. N. R. Devanur and V. V. Vazirani. An improved approximation scheme for computing Arrow-Debreu prices for the linear case. In 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 149-155, 2003.
10. E. Even-Dar, A. Kesselman, and Y. Mansour. Convergence time to Nash equilibria. In Proceedings of the 30th Annual International Colloquium in Automata, Languages, and Programming (ICALP), volume 2719 of Lecture Notes in Computer Science, pages 502-513, 2003.
11. A. Fabrikant, C. H. Papadimitriou, and K. Talwar. The complexity of pure-strategy equilibria. In Proceedings of the 36th Annual ACM Symposium on the Theory of Computing (STOC), 2004.
12. R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. Rode. Selfish routing in non-cooperative networks: A survey. In Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS), volume 2747 of Lecture Notes in Computer Science, pages 21-4, 2003.
13. D. Foster and R. Vohra. Calibrated learning and correlated equilibrium. Games and Economic Behavior, 21:40-55, 1997.
14. D. Foster and R. Vohra. Regret in the on-line decision problem. Games and Economic Behavior, 29:7-35, 1999.
15. D. Gale, H. W. Kuhn, and A. W. Tucker. On symmetric games. In H. W. Kuhn and A. W. Tucker, editors, Contributions to the Theory Games, volume 1, pages 81-87. Princeton University Press, 1950.
16. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
17. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1988. Second Corrected Edition, 1993.
18. K. Jain, M. Mahdian, and A. Saberi. Approximating market equilibria. In Proceedings of the 9th International on Approximation Algorithms for Combinatorial Optimization Problems, 2003.
19. S. Kakade, M. Kearns, J. Langford, and L. Ortiz. Correlated equilibria in graphical games. In Proceedings of the 4th ACM Conference on Electronic Commerce, pages 42-47, 2003.
20. M. Kearns, M. L. Littman, and S. Singh. Graphical models for game theory. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, pages 253-260, 2001.
21. L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191-194, 1979.
22. M. A. Khan and Y. Sun. Non-cooperative games with many players. In R. J. Aumann and S. Hart, editors, Handbook of Game Theory, volume 3, chapter 46. North-Holland, 2002.
23. D. Koller and B. Milch. Multi-agent influence diagrams for representing and solving games. Games and Economic Behavior, 45:181-221, 2003.
24. H. W. Kuhn and A. W. Tucker. Contributions to the Theory of Games, volume 1. Princeton University Press, 1950.
25. R. J. Lipton and E. Markakis. Nash equilibria via polynomial equations. In Proceedings of the Sixth Conference on Latin American Theoretical Informatics (LATIN), pages 413-422, 2004.
26. R. J. Lipton, E. Markakis, and A. Mehta. Playing large games using simple strategies. In Proceedings of the 4th ACM Conference on Electronic Commerce, pages 36-41, 2003.
27. M. L. Littman, M. Kearns, and S. Singh. An efficient exact algorithm for singly connected graphical games. In Advances in Neural Information Processing Systems, volume 14, 2001.
28. M. L. Littman and P. Stone. A polynomial-time Nash equilibrium algorithm for repeated games. In Proceedings of the 4th ACM Conference on Electronic Commerce, pages 48-54, 2003.
29. J. F. Nash, Jr. Equilibrium points in N-person games. In Proceedings of the National Academy of Science, volume 36, pages 48-49, 1950.
30. J. F. Nash, Jr. Non-cooperative games. Annals of Mathematics, 54(2):286-295, 1951.
31. G. Owen. Game Theory. Academic Press, 1995. Third Edition.
32. C. H. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 749-753, 2001.
33. R. W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
34. R. W. Rosenthal. The network equilibrium problem in integers. Networks, 3:53-59, 1973.
35. T. Roughgarden. Selfish Routing. PhD thesis, Cornell University, 2002.
36. R. Savani and B. von Stengel. Long Lemke-Howson paths. Technical Report LSE-CDAM-2003-14, London School of Economics, 2003.
37. Y. Shoham. Introduction to Multi-Agent Systems. 2004. In preparation.
38. A. Vetta. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS), pages 416-425, 2002.
39. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1944.
40. J. W. Weibull. Evolutionary Game Theory. MIT Press, 1997.