Approximate solutions for partially observable stochastic games with common payoffs
暂无分享,去创建一个
Jeff G. Schneider | Geoffrey J. Gordon | Sebastian Thrun | Rosemary Emery-Montemerlo | S. Thrun | J. Schneider | Rosemary Emery-Montemerlo
[1] T. Başar,et al. Dynamic Noncooperative Game Theory , 1982 .
[2] Leslie Pack Kaelbling,et al. Acting Optimally in Partially Observable Stochastic Domains , 1994, AAAI.
[3] Leslie Pack Kaelbling,et al. Learning Policies for Partially Observable Environments: Scaling Up , 1997, ICML.
[4] D. Koller,et al. Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .
[5] B. Stengel,et al. Efficient Computation of Behavior Strategies , 1996 .
[6] Craig Boutilier,et al. Planning, Learning and Coordination in Multiagent Decision Processes , 1996, TARK.
[7] Neil Immerman,et al. The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.
[8] Kee-Eung Kim,et al. Learning to Cooperate via Policy Search , 2000, UAI.
[9] Michael L. Littman,et al. Abstraction Methods for Game Theoretic Poker , 2000, Computers and Games.
[10] Victor R. Lesser,et al. Communication decisions in multi-agent cooperation: model and experiments , 2001, AGENTS '01.
[11] Milind Tambe,et al. The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models , 2011, J. Artif. Intell. Res..
[12] Joelle Pineau,et al. Point-based value iteration: An anytime algorithm for POMDPs , 2003, IJCAI.
[13] David V. Pynadath,et al. Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings , 2003, IJCAI.
[14] Joelle Pineau,et al. Towards robotic assistants in nursing homes: Challenges and results , 2003, Robotics Auton. Syst..
[15] P. J. Gmytrasiewicz,et al. A Framework for Sequential Planning in Multi-Agent Settings , 2005, AI&M.