A polynomial-time Nash equilibrium algorithm for repeated games

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2003, Pages 48-54

  Littman, Michael L ^a   Stone, Peter ^b  

^a RUTGERS UNIVERSITY   (United States)

^b University of Texas at Austin   (United States)

Author keywords

Complexity analysis; Computational game theory; Nash equilibrium; Repeated games

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; STRATEGIC PLANNING; THEOREM PROVING;

COMPUTING EQUILIBRIA; NASH EQUILIBRIUM ALGORITHM; REPEATED GAMES;

GAME THEORY;

EID: 0242456253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/779928.779935     Document Type: Conference Paper

References (14)

1. Robert Axelrod. The Evolution of Cooperation. Basic Books, 1984.
2. Vincent Conitzer and Tuomas Sandholm. Complexity results about Nash equilibria. Technical Report CMU-CS-02-135, CMU School for Computer Science, 2002.
3. János A. Csirik, Michael L. Littman, Satinder Singh, and Peter Stone. FAucS: An FCC spectrum auction simulator for autonomous bidding agents. In Second International Workshop on Electronic Commerce (WELCOM-2001), pages 193-151, 2001.
4. Michael Kearns, Michael L. Littman, and Satinder Singh. Graphical models for game theory. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI), pages 253-260, 2001.
5. Michael L. Littman. Friend-or-foe Q-learning in general-sum games. In Proceedings of the Eighteenth International Conference on Machine Learning, pages 322-328. Morgan Kaufmann, 2001.
6. Michael L. Littman and Peter Stone. Implicit negotiation in repeated games. In Eighth International Workshop on Agent Theories, Architectures, and Languages (ATAL-2001), pages 393-404, 2001.
7. J. F. Nash. Non-cooperative games. Annals of Mathematics, 54: 286-295, 1951.
8. John F. Nash. The bargaining problem. Econometrica, 28: 155-162, 1950.
9. Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. The MIT Press, 1994.
10. Christos H. Papadimitriou. Algorithms, games, and the internet. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 749-753, 2001.
11. Paul S. A. Reitsma, Peter Stone, János A. Csirik, and Michael L. Littman. Self-enforcing strategic demand reduction. In Agent Mediated Electronic Commerce IV: Designing Mechanisms and Systems, volume 2531 of Lecture Notes in Artificial Intelligence. Springer Verlag, 2002.
12. Alexander Schrijver. Theory of Linear and Integer Programming. Wiley-Interscience, New York, NY, 1986.
13. J. von Neumann and O. Morgenstern. Princeton University Press, Princeton, NJ, 1947.
14. Robert J. Weber. Making more from less: Strategic demand reduction in the FCC spectrum auctions. Journal of Economics and Management Strategy, 6(3): 529-548, 1997.