Dynamic programming for partially observable stochastic games

AAAI Workshop - Technical Report

Volumn WS-04-08, Issue , 2004, Pages 25-30

  Hansen, Eric A ^a   Bernstein, Daniel S ^b   Zilberstein, Shlomo ^b  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE-HORIZON POSGS; PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES (POMDPS); PARTIALLY OBSERVABLE STOCHASTIC GAMES; PAYOFFS;

ALGORITHMS; DECISION THEORY; ITERATIVE METHODS; MARKOV PROCESSES; SOFTWARE AGENTS; STOCHASTIC CONTROL SYSTEMS;

DYNAMIC PROGRAMMING;

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

References (18)

1. Becker, R.; Zilberstein, S.; Lesser, V.; and Goldman, C. V. 2003. Transition-independent decentralized Markov decision processes. In Proceedings of the 2nd International Conference on Autonomous Agents and Multi-agent Systems, 41-48.
2. Bernstein, D.; Givan, R.; Immerman, N.; and Zilberstein, S. 2002. The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research 27 (4):819-840.
3. Boutilier, C. 1999. Sequential optimality and coordination in multiagent systems. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, 478-485.
4. Brafman, R., and Tennenholtz, M. 2002. R-MAX-a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research 3:213-231.
5. Filar, J., and Vrieze, K. 1997. Competitive Markov Decision Processes. Springer-Verlag.
6. Hsu, K., and Marcus, S. I. 1982. Decentralized control of finite state Markov processes. IEEE Transactions on Automatic Control AC-27(2):426-431.
7. Hu, J., and Wellman, M. 2003. Nash Q-learaing for general-sum stochastic games. Journal of Machine Learning Research 4:1039-1069.
8. Kaelbling, L.; Littman, M.; and Cassandra, A. 1998. Planning and acting in partially observable stochastic domains. Artificial Intelligence 101:99-134.
9. Kearns, M.; Mansour, Y.; and Singh, S. 2000. Fast planning in stochastic games. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence (UAI-00), 309-316.
10. Koller, D.; Megiddo, N.; and von Stengel, B. 1994. Fast algorithms for finding randomized strategies in game trees. In Proceedings of the 26th ACM Symposium on Theory of Computing, 750-759.
11. Kuhn, H. 1953. Extensive games and the problem of information. In Kuhn, H., and Tucker, A., eds., Contributions to the Theory of Games II. Princeton University Press. 193-216.
12. Littman, M. 1994. Markov games as a framework for multi-agent reinforcement learning. In Proceedings of the 11th International Conference on Machine Learning, 157-163.
13. Nair, R.; Pynadath, D.; Yokoo, M.; Tambe, M.; and Marsella, S. 2003. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, 705-711.
14. Ooi, J. M., and Wornell, G. W. 1996. Decentralized control of a multiple access broadcast channel: Performance bounds. In Proceedings of the 35th Conference on Decision and Control, 293-298.
15. Peshkin, L.; Kim, K.-E.; Meuleau, N.; and Kaelbling, L. P. 2000. Learning to cooperate via policy search. In Proceedings of the 16th International Conference on Uncertainty in Artificial Intelligence, 489-496.
16. Poupart, P., and Boutilier, C. 2004. Bounded finite state controllers. In Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference. MIT Press.
17. Shapley, L. 1953. Stochastic games. Proceedings of the National Academy of Sciences of the United States of America 39:1095-1100.
18. Smallwood, R., and Sondik, E. 1973. The optimal control of partially observable Markov processes over a finite horizon. Operations Research 21:1071-1088.