Reward revision and the average reward Markov decision process
From MaRDI portal
Publication:1097179
DOI10.1007/BF01719829zbMath0634.90093OpenAlexW2084847333MaRDI QIDQ1097179
William T. Scherer, Chelsea C. III White
Publication date: 1987
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01719829
successive approximationsmodified policy iterationaverage reward Markov decision processreward revision
Related Items (1)
Cites Work
- Unnamed Item
- Suboptimal policy determination for large-scale Markov decision processes. I: Description and bounds
- Dynamic programming and stochastic control
- Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes
- Reward Revision for Discounted Markov Decision Problems
- Suboptimal Design for Large Scale, Multimodule Systems
- Modified Policy Iteration Algorithms for Discounted Markov Decision Problems
- Approximations of Dynamic Programs, I
- Approximations of Dynamic Programs, II
- Suboptimal policy determination for large-scale Markov decision processes. II: Implementation and numerical evaluation
This page was built for publication: Reward revision and the average reward Markov decision process