Second Order optimality in Markov decision chains

Sladký, Karel. "Second Order optimality in Markov decision chains." Kybernetika 53.6 (2017): 1086-1099. <http://eudml.org/doc/294847>.

@article{Sladký2017,
abstract = {The article is devoted to Markov reward chains in discrete-time setting with finite state spaces. Unfortunately, the usual optimization criteria examined in the literature on Markov decision chains, such as a total discounted, total reward up to reaching some specific state (called the first passage models) or mean (average) reward optimality, may be quite insufficient to characterize the problem from the point of a decision maker. To this end it seems that it may be preferable if not necessary to select more sophisticated criteria that also reflect variability-risk features of the problem. Perhaps the best known approaches stem from the classical work of Markowitz on mean variance selection rules, i. e. we optimize the weighted sum of average or total reward and its variance. The article presents explicit formulae for calculating the variances for transient and discounted models (where the value of the discount factor depends on the current state and action taken) for finite and infinite time horizon. The same result is presented for the long run average nondiscounted models where finding stationary policies minimizing the average variance in the class of policies with a given long run average reward is discussed.},
author = {Sladký, Karel},
journal = {Kybernetika},
keywords = {Markov decision chains; second order optimality; optimality conditions for transient; discounted and average models; policy iterations; value iterations},
language = {eng},
number = {6},
pages = {1086-1099},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Second Order optimality in Markov decision chains},
url = {http://eudml.org/doc/294847},
volume = {53},
year = {2017},
}

TY - JOUR
AU - Sladký, Karel
TI - Second Order optimality in Markov decision chains
JO - Kybernetika
PY - 2017
PB - Institute of Information Theory and Automation AS CR
VL - 53
IS - 6
SP - 1086
EP - 1099
AB - The article is devoted to Markov reward chains in discrete-time setting with finite state spaces. Unfortunately, the usual optimization criteria examined in the literature on Markov decision chains, such as a total discounted, total reward up to reaching some specific state (called the first passage models) or mean (average) reward optimality, may be quite insufficient to characterize the problem from the point of a decision maker. To this end it seems that it may be preferable if not necessary to select more sophisticated criteria that also reflect variability-risk features of the problem. Perhaps the best known approaches stem from the classical work of Markowitz on mean variance selection rules, i. e. we optimize the weighted sum of average or total reward and its variance. The article presents explicit formulae for calculating the variances for transient and discounted models (where the value of the discount factor depends on the current state and action taken) for finite and infinite time horizon. The same result is presented for the long run average nondiscounted models where finding stationary policies minimizing the average variance in the class of policies with a given long run average reward is discussed.
LA - eng
KW - Markov decision chains; second order optimality; optimality conditions for transient; discounted and average models; policy iterations; value iterations
UR - http://eudml.org/doc/294847
ER -