Solving Markovian decision processes by successive elimination of variables
暂无分享,去创建一个
[1] E. Denardo. CONTRACTION MAPPINGS IN THE THEORY UNDERLYING DYNAMIC PROGRAMMING , 1967 .
[2] Paul J. Schweitzer,et al. On the existence of relative values for undiscounted Markovian decision processes with a scalar gain rate , 1984 .
[3] William S. Jewell,et al. Markov-Renewal Programming. I: Formulation, Finite Return Models , 1963 .
[4] E. Denardo,et al. Multichain Markov Renewal Programs , 1968 .
[5] P. Schweitzer. On the solvability of Bellman's functional equations for Markov renewal programming , 1983 .
[6] J. Bather. Optimal decision procedures for finite Markov chains. Part II: Communicating systems , 1973, Advances in Applied Probability.
[7] Paul J. Schweitzer,et al. The Functional Equations of Undiscounted Markov Renewal Programming , 1971, Math. Oper. Res..
[8] H. Mine,et al. Linear programming algorithms for semi-Markovian decision processes , 1968 .