On local rewards and scaling distributed reinforcement learning

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages 91-98

  Bagnell, J Andrew ^a   Ng, Andrew Y ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED REINFORCEMENT LEARNING; GLOBAL REWARD SIGNALS; LOWER BOUNDS; MARKOV DECISION PROCESSES; MULTI-AGENT REINFORCEMENT LEARNING; NUMBER OF SAMPLES;

MARKOV PROCESSES;

LEARNING ALGORITHMS;

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

References (11)

1. N. Alon and J. Spencer. The Probabilistic Method. Wiley, 2000.
2. C. Boutilier, T. Dean, and S. Hanks. Decision theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 1999.
3. Y. Chang, T. Ho, and L. Kaelbling. All learning is local: Multi-agent learning in global reward games. In Advances in NIPS 14, 2004.
4. C. Guestrin, D. Koller, and R. Parr. Multi-agent planning with factored MDPs. In NIPS-14, 2002.
5. C. Guestrin, M. Lagoudakis, and R. Parr. Coordinated reinforcement learning. In ICML, 2002.
6. M. Kearns and D. Koller. Efficient reinforcement learning in factored mdps. In IJCAI 16, 1999.
7. M. Kearns, M. Littman, and S. Singh. Graphical models for game theory. In UAI, 2001.
8. M. Kearns, Y. Mansour, and A. Ng. Approximate planning in large POMDPs via reusable trajectories. (extended version of paper in NIPS 12), 1999.
9. L. Peshkin, K-E. Kim, N. Meleau, and L. Kaelbling. Learning to cooperate via policy search. In UAI 16, 2000.
10. J. Schneider, W. Wong, A. Moore, and M. Riedmiller. Distributed value functions. In ICML, 1999.
11. R. Williams and L. Baird. Tight performance bounds on greedy policies based on imperfect value functions. Technical report, Northeastern University, 1993.