Interaction-driven Markov games for decentralized multiagent planning under uncertainty

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 1, Issue , 2008, Pages 518-525

  Spaan, Matthijs T J ^a   Melo, Francisco S ^a,b  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b Carnegie Mellon University   (United States)

Author keywords

Cooperative multiagent systems; Planning under uncertainty; Team Markov games

Indexed keywords

AUTONOMOUS AGENTS;

APPROXIMATE SOLUTION; COOPERATIVE MULTIAGENT SYSTEMS; FUNDAMENTAL PROPERTIES; MARKOV GAMES; MULTI-AGENT DECISION MAKING; MULTI-AGENT PLANNING; MULTIAGENT DECISIONS; PLANNING UNDER UNCERTAINTY;

MULTI AGENT SYSTEMS;

EID: 84899992307     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. R. Becker, S. Zilberstein, V. Lesser, and C. Goldman. Solving transition independent decentralized Markov decision processes. J. Artificial Intelligence Research, 22:423-455, 2004.
2. D. Bernstein, E. Hansen, and S. Zilberstein. Bounded policy iteration for decentralized POMDPs. In Proc. Int. Joint Conf. Artificial Intelligence, pages 1287-1292, 2005.
3. D. Bernstein, S. Zilberstein, and N. Immerman. The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research, 27(4):819-840, 2002.
4. D. Bertsekas and J. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, 1996.
5. C. Boutilier. Planning, learning and coordination in multiagent decision processes. In Theoretical Aspects of Rationality and Knowledge, 1996.
6. A. Cassandra. Exact and approximate algorithms for partially observable Markov decision processes. PhD thesis, Brown University, 1998.
7. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In Proc. Int. Joint Conf. Autonomous Agents and Multi Agent Systems, volume 1, pages 136-143, 2004.
8. P. Gmytrasiewicz and P. Doshi. A framework for sequential planning in multiagent settings. J. Artificial Intelligence Research, 24:49-79, 2005.
9. J. Hu and M. Wellman. Nash Q-learning for general sum stochastic games. J. Machine Learning Research, 4:1039-1069, 2003.
10. J. Kok, P. Hoen, B. Bakker, and N. Vlassis. Utile coordination: Learning interdependencies among cooperative agents. In Proc. Symp. on Computational Intelligence and Games, pages 29-36, 2005.
11. H. Kuhn. Extensive games and the problem of information. Annals of Mathematics Studies, 28:193-216, 1953.
12. N. Meuleau, M. Hauskrecht, K. Kim, L. Peshkin, L. Kaelbling, T. Dean, and C. Boutilier. Solving very large weakly coupled Markov decision processes. In Proc. Nat. Conf. Artificial Intelligence, pages 165-172, 1998.
13. R. Nair, P. Varakantham, M. Tambe, and M. Yokoo. Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs. In Proc. Nat. Conf. Artificial Intelligence, pages 133-139, 2005.
14. F. A. Oliehoek, M. T. J. Spaan, and N. Vlassis. Optimal and approximate Q-value functions for decentralized POMDPs. J. Artificial Intelligence Research, 2008. To appear.
15. F. A. Oliehoek, M. T. J. Spaan, S. Whiteson, and N. Vlassis. Exploiting locality of interaction in factored Dec-POMDPs. In Proc. Int. Joint Conf. Autonomous Agents and Multi Agent Systems, 2008.
16. R. Porter, E. Nudelman, and Y. Shoham. Simple search methods for finding a Nash equilibrium. Games and Economic Behavior, 2006 (in press).
17. B. Price and C. Boutilier. Implicit imitation in multiagent reinforcement learning. In Proc. Int. Conf. Machine Learning, pages 325-334, 1999.
18. D. Pynadath and M. Tambe. The communicative multiagent team decision problem: Analyzing teamwork theories and models. J. Artificial Intelligence Research, 16:389-423, 2002.
19. M. Roth, R. Simmons, and M. Veloso. Decentralized communication strategies for coordinated multi-agent policies. In Multi-Robot Systems: From Swarms to Intelligent Automata, volume III, pages 93-106, 2005.
20. M. Roth, R. Simmons, and M. Veloso. Exploiting factored representations for decentralized execution in multi-agent teams. In Proc. Int. Joint Conf. Autonomous Agents and Multi Agent Systems, 2007.
21. S. Singh and D. Cohn. How to dynamically merge Markov decision processes. In M. Jordan, M. Kearns, and S. Solla, editors, Adv. Neural Information Processing Systems 10, pages 1057-1063, 1998.