Learning against opponents with bounded memory

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 817-822

  Powers, Rob ^a   Shoham, Yoav ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST RESPONSE; BOUNDED MEMORY; EMPIRICAL TEST; MULTI-AGENT SETTING; SELF-PLAY;

MULTI AGENT SYSTEMS;

ALGORITHMS;

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

References (25)

1. Robert Axelrod. The Evolution of Cooperation. Basic Books, New York, 1984.
2. Michael Bowling and Manuela Veloso. Multiagent learning using a variable learning rate. Artificial Intelligence, 136:215-250, 2002.
3. Michael Bowling. Convergence and no-regret in multiagent learning. In Advances in Neural Information Processing Systems 17. MIT Press, 2005.
4. George Brown. Iterative solution of games by fictitious play. In Activity Analysis of Production and Allocation. John Wiley and Sons, New York, 1951.
5. Yu-Han Chang and Leslie Pack Kaelbling. Playing is believing: The role of beliefs in multi-agent learning. In Advances in Neural Information Processing Systems 14, pages 1483-1490, 2002.
6. Lonnie Chrisman. Reinforcement learning with perceptual aliasing: The perceptual distinctions approach. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 183-188, 1992.
7. Caroline Claus and Craig Boutilier. The dynamics of reinforcement learning in cooperative multiagent systems. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pages 746-752, 1998.
8. Vincent Conitzer and Tuomas Sandholm. Awesome: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents. In Proceedings of the 20th International Conference on Machine Learning, pages 83-90, 2003.
9. Daniela Pucci de Farias and Nimrod Megiddo. How to combine expert (or novice) advice when actions impact the environment. In Advances in Neural Information Processing Systems 16, 2004.
10. Drew Fudenberg and David Levine. Universal consistency and cautious fictitious play. Journal of Economic Dynamics and Control, 19:1065-1089, 1995.
11. Drew Fudenberg and David Levine. Conditional universal consistency. Games and Economic Behavior, 29:104-130, 1999.
12. Sergiu Hart and Andreu Mas-Colell. A simple adaptive procedure leading to correlated equilibrium. Econometrica, 68:1127-1150, 2000.
13. Wassily Hoeffding. On the distribution of the number of successes in independent trials. Annals of Mathematical Statistics, 27:713-721, 1956.
14. Amir Jafari, Amy Greenwald, David Gondek, and Gunes Ercal. On no-regret learning, fictitious play, and nash equilibrium. In Proceedings of the Eighteenth International Conference on Machine Learning, pages 226-223, 2001.
15. Ehud Kalai and Ehud Lehrer. Rational learning leads to nash equilibrium. Econometrica, 61(5):1019-1045, 1993.
16. Kevin Leyton-Brown, Eugene Nudelman, Galen Andrew, Jim McFadden, and Yoav Shoham. A portfolio approach to algorithm selection. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 2003.
17. Michael Littman and Peter Stone. Implicit negotiation in repeated games. In Proceedings of The Eighth International Workshop on Agent Theories, Architectures, and Languages, pages 393-404, 2001.
18. Michael L. Littman. Markov games as a framework for multi-agent reinforcement learning. In Proceedings of the 11th International Conference on Machine Learning, pages 157-163, 1994.
19. Abraham Neyman. Bounded complexity justifies cooperation in finitely repeated prisoner's dilemma. Economic Letters, pages 227-229, 1985.
20. Daniel Nikovski and Illah Nourbakhsh. Learning probabilistic models for decision-theoretic navigation of mobile robots. In Proceedings of the International Conference on Machine Learning, pages 266-274, 2000.
21. Eugene Nudelman, Jenn Wortman, Kevin Leyton-Brown, and Yoav Shoham. Run the gamut: A comprehensive approach to evaluating game-theorectic algorithms. AAMAS, 2004.
22. Christos H. Papadimitriou and Mihalis Yannakakis. On complexity as bounded rationality. In STOC-94, pages 726-733, 1994.
23. Rob Powers and Yoav Shoham. New criteria and a new algorithm for learning in multiagent systems. In Advances in Neural Information Processing Systems 17. MIT Press, 2005.
24. Gerald Tesauro. Extending q-learning to general adaptive multi-agent systems. In Advances in Neural Information Processing Systems, volume 16, 2004.
25. Chris Watkins and Peter Dayan. Technical note: Q-learning. Machine Learning, 8(3/4):279-292, May 1992.