论文信息 - Generalized polynomial approximations in Markovian decision processes - 字舞流文

Generalized polynomial approximations in Markovian decision processes

P. Schweitzer | A. Seidmann

[1] A. Hordijk,et al. Linear Programming and Markov Decision Chains , 1979 .

[2] Paul J. Schweitzer,et al. The Functional Equations of Undiscounted Markov Renewal Programming , 1971, Math. Oper. Res..

[3] James W. Daniel,et al. Splines and efficiency in dynamic programming , 1976 .

[4] Evan L. Porteus. Bounds and Transformations for Discounted Finite Markov Decision Chains , 1975, Oper. Res..

[5] Paul J. Schweitzer. Multiple Policy Improvements in Undiscounted Markov Renewal Programming , 1971, Oper. Res..

[6] N. A. J. Hastings. Technical Note - Bounds on the Gain of a Markov Decision Process , 1971, Oper. Res..

[7] Cyrus Derman,et al. Finite State Markovian Decision Processes , 1970 .

[8] H. Mine,et al. Linear programming algorithms for semi-Markovian decision processes , 1968 .

[9] E. Denardo,et al. Multichain Markov Renewal Programs , 1968 .

[10] J. MacQueen. A MODIFIED DYNAMIC PROGRAMMING METHOD FOR MARKOVIAN DECISION PROBLEMS , 1966 .

[11] E. Cheney. Introduction to approximation theory , 1966 .

[12] William S. Jewell,et al. Markov-Renewal Programming. I: Formulation, Finite Return Models , 1963 .

[13] D. White. Dynamic programming, Markov chains, and the method of successive approximations , 1963 .

[14] R. Bellman,et al. Polynomial approximation—a new computational technique in dynamic programming: Allocation processes , 1962 .