메뉴 건너뛰기




Volumn , Issue , 2004, Pages 709-715

Dynamic programming for partially observable stochastic games

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMS; PARTIALLY OBSERVABLE STOCHASTIC GAMES (POSG); STATE TRANSITIONS; STOCHASTIC GAMES;

EID: 9444233318     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (430)

References (23)
  • 4
    • 0041965975 scopus 로고    scopus 로고
    • R-MAX-a general polynomial time algorithm for near-optimal reinforcement learning
    • 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.
    • (2002) Journal of Machine Learning Research , vol.3 , pp. 213-231
    • Brafman, R.1    Tennenholtz, M.2
  • 10
    • 0020113091 scopus 로고
    • Decentralized control of finite state Markov processes
    • Hsu, K., and Marcus, S. I. 1982. Decentralized control of finite state Markov processes. IEEE Transactions on Automatic Control AC-27(2):426-431.
    • (1982) IEEE Transactions on Automatic Control , vol.AC-27 , Issue.2 , pp. 426-431
    • Hsu, K.1    Marcus, S.I.2
  • 11
    • 4644369748 scopus 로고    scopus 로고
    • Nash Q-learning for general-sum stochastic games
    • Hu, J., and Wellman, M. 2003. Nash Q-learning for general-sum stochastic games. Journal of Machine Learning Research 4:1039-1069.
    • (2003) Journal of Machine Learning Research , vol.4 , pp. 1039-1069
    • Hu, J.1    Wellman, M.2
  • 12
    • 0032073263 scopus 로고    scopus 로고
    • Planning and acting in partially observable stochastic domains
    • Kaelbling, L.; Littman, M.; and Cassandra, A. 1998. Planning and acting in partially observable stochastic domains. Artificial Intelligence 101:99-134.
    • (1998) Artificial Intelligence , vol.101 , pp. 99-134
    • Kaelbling, L.1    Littman, M.2    Cassandra, A.3
  • 14
    • 0031192989 scopus 로고    scopus 로고
    • Representations and solutions for game-theoretic problems
    • Koller, D., and Pfeffer, A. 1997. Representations and solutions for game-theoretic problems. Artificial Intelligence 94(1):167-215.
    • (1997) Artificial Intelligence , vol.94 , Issue.1 , pp. 167-215
    • Koller, D.1    Pfeffer, A.2
  • 16
    • 0000619048 scopus 로고
    • Extensive games and the problem of information
    • In Kuhn, H., and Tucker, A., eds., Princeton University Press
    • 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.
    • (1953) Contributions to the Theory of Games II , pp. 193-216
    • Kuhn, H.1
  • 23
    • 0015658957 scopus 로고
    • The optimal control of partially observable Markov processes over a finite horizon
    • Smallwood, R., and Sondik, E. 1973. The optimal control of partially observable Markov processes over a finite horizon. Operations Research 21:1071-1088.
    • (1973) Operations Research , vol.21 , pp. 1071-1088
    • Smallwood, R.1    Sondik, E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.