Approximate solutions for partially observable stochastic games with common payoffs

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

Volumn 1, Issue , 2004, Pages 136-143

  Emery Montemerlo, Rosemary ^a   Gordon, Geoff ^a   Schneider, Jeff ^a   Thrun, Sebastian ^b  

^a Carnegie Mellon University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN GAMES; MARKOV DECISION PROCESSES (MDP); STOCHASTIC GAMES;

ALGORITHMS; DECISION MAKING; GAME THEORY; MARKOV PROCESSES; MULTI AGENT SYSTEMS; PROBABILITY; SENSORS; STATE SPACE METHODS;

ROBOTICS;

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

References (16)

1. D. S. Bernstein, S. Zilberstein, and N. Immerman. The complexity of decentralized control of Markov decision processes. In UAI, 2000.
2. C. Boutilier. Planning, learning and coordination in multiagent decision processes. In Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge, 1996.
3. A. R. Cassandra, L. P. Kaelbling, and M. L. Littman. Acting optimally in partially observable stochastic domains. In AIAA, 1994.
4. D. Fudenberg and J. Tirole. Game Theory. MIT Press, Cambridge, MA, 1991.
5. P. J. Gmytrasiewicz and P. Doshi. A framework for sequential planning in multi-agent settings. In Proceedings of the 8th International Symposium on Artificial Intelligence and Mathematics, Ft. Lauderdale, Florida, January 2004.
6. D. Koller, N. Megiddo, and B. von Stengel. Efficient computation of equilibria for extensive two-person games. Games and Economic Behavior, 14(2):247-259, June 1996.
7. M. L. Littman, A. R. Cassandra, and L. P. Kaelbling. Learning policies for partially observable environments: Scaling up. In ICML, 1995.
8. R. Nair, M. Tambe, M. Yokoo, D. Pynadath, and S. Marsella. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In IJCAI, 2003.
9. L. Peshkin, K.-E. Kim, N. Meuleau, and L. P. Kaelbling. Learning to cooperate via policy search. In UAI, 2000.
10. J. Pineau, G. Gordon, and S. Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In UAI, 2003.
11. J. Pineau, M. Montemerlo, M. Pollack, N. Roy, and S. Thrun. Towards robotic assistants in nursing homes: Challenges and results. Robotics and Autonomous Systems, 42(3-4):271-281, March 2003.
12. D. Pynadath and M. Tambe. The communicative multiagent team decision problem: Analyzing teamwork theories and models. Journal of Artificial Intelligence Research, 2002.
13. S. Russell and P. Norvig. Section 6.5: Games that include an element of chance. In Artificial Intelligence: A Modern Approach. Prentice Hall, 2nd edition, 2002.
14. J. Shi and M. L. Littman. Abstraction methods for game theoretic poker. Computers and Games, pages 333-345, 2000.
15. B. von Stengel. Efficient computation of behavior strategies. Games and Economic Behavior, 14(2):220-246, June 1996.
16. P. Xuan, V. Lesser, and S. Zilberstein. Communication decisions in multi-agent cooperation: Model and experiments. In Agents-01, 2001.