Optimistic-pessimistic Q-learning algorithm for multi-agent systems

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

Volumn 5244 LNAI, Issue , 2008, Pages 13-24

  Akchurina, Natalia ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Algorithmic game theory; Multi agent reinforcement learning

Indexed keywords

EDUCATION; ELECTRIC SHIP EQUIPMENT; GAME THEORY; LEARNING SYSTEMS; MULTI AGENT SYSTEMS; REINFORCEMENT; REINFORCEMENT LEARNING; WELL TESTING;

ALGORITHMIC GAME THEORY; MULTI-AGENT REINFORCEMENT LEARNING; REINFORCEMENT LEARNING ALGORITHMS; STATIONARY POLICIES;

LEARNING ALGORITHMS;

EID: 56549086866     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87805-6_3     Document Type: Conference Paper

References (10)

1. Littman, M.L.: Markov games as a framework for multi-agent reinforcement learning. In: ICML, pp. 157-163 (1994)
2. Littman, M.L.: Priend-or-foe q-learning in general-sum games. In: Brodley, C.E., Danyluk, A.P. (eds.) ICML, pp. 322-328. Morgan Kaufmann, San Francisco (2001)
3. Hu, J., Wellman, M.P.: Multiagent reinforcement learning: theoretical framework and an algorithm. In: Proc. 15th International Conf. on Machine Learning, pp. 242-250. Morgan Kaufmann, San Francisco (1998)
4. Glaus, C., Boutiller, C.: The dynamics of reinforcement learning in cooperative multiagent systems. In: AAAI 1998/IAAI 1998: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, pp. 746-752. American Association for Artificial Intelligence, Menlo Park (1998)
5. Bowling, M.H., Veloso, M.M.: Multiagent learning using a variable learning rate. Artificial Intelligence 136(2), 215-250 (2002)
6. Szepesvári, C., Littman, M.L.: Generalized markov decision processes: Dynamic-programming and reinforcement-learnig algorithms. Technical report, Providence, RI, USA (1996)
7. Robbins, H., Monro, S.: A stochastic approximation method. Annals of Mathematical Statistics 22(3), 400-407 (1951)
8. Arrow, K.: Hurwiczs optimality criterion for decision making under ignorance. Technical Report 6, Stanford University (1953)
9. Nudelman, E., Wortman, J., Shoham, Y., Leyton-Brown, K.: Run the gamut: A comprehensive approach to evaluating game-theoretic algorithms. In: AAMAS 2004, pp. 880-887. IEEE Computer Society. Los Alamitos (2004)
10. Watkins, C.J.C.H.: Learning from Delayed Rewards. PhD thesis, King's College, Cambridge, England (1989)