The Smoothed Complexity of Policy Iteration for Markov Decision Processes
Abstract
References
Index Terms
- The Smoothed Complexity of Policy Iteration for Markov Decision Processes
Recommendations
Optimally solving Markov decision processes with total expected discounted reward function
Compared computational performance of linear programming and the policy iteration.Considered only discrete-time infinite-horizon MDPs with discounted reward.Used randomly generated test problems and a real-life health-care problem.Showed that, unlike ...
Policy Bounds for Markov Decision Processes
This paper demonstrates how a Markov decision process MDP can be approximated to generate a policy bound, i.e., a function that bounds the optimal policy from below or from above for all states. We present sufficient conditions for several ...
The Complexity of Markov Decision Processes
We investigate the complexity of the classical problem of optimal policy computation in Markov decision processes. All three variants of the problem finite horizon, infinite horizon discounted, and infinite horizon average cost were known to be solvable ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/61ad52a5-22ed-44c8-8bee-8976b773ecce/3564246.cover.jpg)
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 159Total Downloads
- Downloads (Last 12 months)142
- Downloads (Last 6 weeks)19
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in