Online multiagent learning against memory bounded adversaries

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

Volumn 5211 LNAI, Issue PART 1, 2008, Pages 211-226

  Chakraborty, Doran ^a   Stone, Peter ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS; DATABASE SYSTEMS; EDUCATION; FLOW INTERACTIONS; LEARNING SYSTEMS; ROBOT LEARNING;

BEST RESPONSES; ENHANCE LEARNINGS; FIXED SETS; LEARNED KNOWLEDGES; MARKOV DECISION PROCESSES; MULTI-AGENT LEARNINGS; OPTIMALITY; STATE SPACES;

LEARNING ALGORITHMS;

EID: 56049086673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87479-9_32     Document Type: Conference Paper

References (16)

1. Banerjee, B., Peng, J.: Efficient learning of multi-step best response. In: AAMAS 2005: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, pp. 60-66. ACM Press, New York (2005)
2. Banerjee, B., Peng, J.: Rvσ(t): a unifying approach to performance and convergence in online multiagent learning. In: AAMAS 2006: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, pp. 798-800. ACM Press, New York (2006)
3. Bowling, M.: Convergence and no-regret in multiagent learning. In: Neural Information Processing Systems, vol. 17. MIT Press, Cambridge (2005)
4. Bowling, M., Veloso, M.: Convergence of gradient dynamics with a variable learning rate. In: Proc. 18th International Conf. on Machine Learning, pp. 27-34. Morgan Kaufmann, San Francisco (2001)
5. Bowling, M.H., Veloso, M.M.: Rational and convergent learning in stochastic games. In: IJCAI, pp. 1021-1026 (2001)
6. Brafman, R.I., Tennenholtz, M.: R-max - a general polynomial time algorithm for near-optimal reinforcement learning. J. Mach. Learn. Res. 3, 213-231 (2003)
7. Claus, O., Boutilier, C.: The dynamics of reinforcement learning in cooperative multiagent systems. In: AAAI/IAAI, pp. 746-752 (1998)
8. Conitzer, V., Sandholm, T.: Awesome: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents, pp. 83-90 (2003)
9. Fudenberg, D., Levine, D.K.: The theory of learning in games. MIT Press, Cambridge (1999)
10. Greenwald, A., Jafari, A., Ercal, G., Gondek, D.: On no-regret learning, fictitious play, and nash equilibrium
11. Littman, M.L.: Markov games as a framework for multi-agent reinforcement learning. In: Proceedings of the 11th International Conference on Machine Learning (ML 1994), New Brunswick, NJ, pp. 157-163. Morgan Kaufmann, San Francisco (1994)
12. Nash Jr., J.F.: Equilibrium points in n-person games. In: Classics in game theory (1997)
13. Powers, R., Shoham, Y.: Learning against opponents with bounded memory. In: IJCAI, pp. 817-822 (2005)
14. Singh, S., Kearns, M., Mansour, Y.: Nash convergence of gradient dynamics in general-sum games, pp. 541-548
15. Stone, P., Littman, M.L.: Implicit negotiation in repeated games. In: Meyer, J.-J.C., Tambe, M. (eds.) ATAL 2001. LNCS (LNAI), vol. 2333, pp. 96-105. Springer, Heidelberg (2002)
16. Vu, T., Powers, R., Shoham, Y.: Learning against multiple opponents. In: A AMAS 2006: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, pp. 752-759. ACM Press, New York (2006)