메뉴 건너뛰기




Volumn 121, Issue 1, 2000, Pages 31-47

Near-optimal polynomial time algorithm for learning in certain classes of stochastic games

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; GAME THEORY; LEARNING ALGORITHMS; LEARNING SYSTEMS; MARKOV PROCESSES; POLYNOMIALS;

EID: 0034247018     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00039-4     Document Type: Article
Times cited : (31)

References (10)
  • 2
    • 0000182415 scopus 로고
    • A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
    • Chernoff H. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. Vol. 23:1952;493-509.
    • (1952) Ann. Math. Statist. , vol.23 , pp. 493-509
    • Chernoff, H.1
  • 8
    • 0019537014 scopus 로고
    • An order field property for stochastic games when one player controls transition probabilities
    • Parthasarathy T., Raghavan T.E.S. An order field property for stochastic games when one player controls transition probabilities. J. Optim. Theory Appl. Vol. 33:1981;375-392.
    • (1981) J. Optim. Theory Appl. , vol.33 , pp. 375-392
    • Parthasarathy, T.1    Raghavan, T.E.S.2
  • 10
    • 0009656414 scopus 로고
    • Linear programming and undiscounted stochastic game in which one player controls transitions
    • Vrieze O.J. Linear programming and undiscounted stochastic game in which one player controls transitions. OR Spektrum. Vol. 3:1981;29-35.
    • (1981) OR Spektrum , vol.3 , pp. 29-35
    • Vrieze, O.J.1


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