Mean-Variance Optimization in Markov Decision Processes
Author(s)
Mannor, Shie; Tsitsiklis, John N.
DownloadC-11-mv-MDP-ICML.pdf (376.9Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomized or history-based policies can improve performance. We prove that the complexity of computing a policy that maximizes the mean reward under a variance constraint is NP-hard for some cases, and strongly NP-hard for others. We finally offer pseudo-polynomial exact and approximation algorithms.
Date issued
2011-06Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Proceedings of the Twenty-Eighth International Conference on Machine Learning, ICML 2011
Publisher
International Machine Learning Society
Citation
Mannor, Shie and John Tsitsiklis. "Mean-Variance Optimization in Markov Decision Processes ." in Twenty-Eighth International Conference on Machine Learning, ICML 2011, Jun. 28-Jul.2, Bellevue, Washington. 2011.
Version: Author's final manuscript
ISBN
9781450306195
1450306195