Mean-Variance Optimization in Markov Decision Processes
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 th...
Main Authors: | Mannor, Shie, Tsitsiklis, John N. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
International Machine Learning Society
2013
|
Online Access: | http://hdl.handle.net/1721.1/79401 https://orcid.org/0000-0003-2658-8239 |
Similar Items
-
Algorithmic aspects of mean–variance optimization in Markov decision processes
by: Tsitsiklis, John N, et al.
Published: (2017) -
Approachability in repeated games: Computational aspects and a Stackelberg variant
by: Mannor, Shie, et al.
Published: (2010) -
Online learning with sample path constraints
by: Mannor, Shie, et al.
Published: (2010) -
Control charts for monitoring process mean and variance
by: Tian, Yu.
Published: (2008) -
Simulation-based optimization of Markov decision processes
by: Marbach, Peter, 1966-
Published: (2005)