On dynamic programming recursions for multiplicative Markov decision chains
暂无分享,去创建一个
[1] Richard Bellman,et al. Introduction to Matrix Analysis , 1972 .
[2] R. Bellman. Introduction To Matrix Analysis By Richard Bellman, New York, 1960 , 1960 .
[3] W. Barry. On the Iterative Method of Dynamic Programming on a Finite Space Discrete Time Markov Process , 1965 .
[4] R. Bellman. Dynamic programming. , 1957, Science.
[5] E. Lanery,et al. Étude asymptotique des systèmes markoviens à commande , 1967 .
[6] E. Seneta,et al. THE THEORY OF NON-NEGATIVE MATRICES IN A DYNAMIC PROGRAMMING PROBLEM , 1969 .
[7] R. Howard,et al. Risk-Sensitive Markov Decision Processes , 1972 .
[8] E. Seneta. Non-negative matrices;: An introduction to theory and applications , 1973 .
[9] P. Schweitzer,et al. The asymptotic behaviour of the minimal total expected cost for the denumerable state Markov decision model : (prepublication) , 1975 .
[10] Eugene Seneta,et al. Non‐Negative Matrices , 1975 .
[11] Dimitri P. Bertsekas,et al. Dynamic Programming and Stochastic Control , 1977, IEEE Transactions on Systems, Man, and Cybernetics.