Contraction mappings underlying undiscounted Markov decision problems. II
From MaRDI portal
Publication:1101358
DOI10.1016/0022-247X(88)90051-0zbMath0642.90102OpenAlexW1966409179MaRDI QIDQ1101358
Publication date: 1988
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(88)90051-0
Cites Work
- Contraction mappings underlying undiscounted Markov decision problems
- Dynamic programming, Markov chains, and the method of successive approximations
- The Functional Equations of Undiscounted Markov Renewal Programming
- Geometric convergence of value-iteration in multichain Markov decision problems
- The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems
- Contraction Mappings in the Theory Underlying Dynamic Programming