Contraction mappings underlying undiscounted Markov decision problems
- 1 October 1978
- journal article
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 65 (3) , 711-730
- https://doi.org/10.1016/0022-247x(78)90174-9
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision ProblemsMathematics of Operations Research, 1977
- Exponential convergence of products of stochastic matricesJournal of Mathematical Analysis and Applications, 1977
- Optimal decision procedures for finite Markov chains. Part II: Communicating systemsAdvances in Applied Probability, 1973
- Iterative solution of the functional equations of undiscounted Markov renewal programmingJournal of Mathematical Analysis and Applications, 1971
- On Finding the Maximal Gain for Markov Decision ProcessesOperations Research, 1969
- Multichain Markov Renewal ProgramsSIAM Journal on Applied Mathematics, 1968
- Contraction Mappings in the Theory Underlying Dynamic ProgrammingSIAM Review, 1967
- A modified dynamic programming method for Markovian decision problemsJournal of Mathematical Analysis and Applications, 1966
- On the Iterative Method of Dynamic Programming on a Finite Space Discrete Time Markov ProcessThe Annals of Mathematical Statistics, 1965
- Dynamic programming, Markov chains, and the method of successive approximationsJournal of Mathematical Analysis and Applications, 1963