Estimates for perturbations of average Markov decision processes with a minimal state and upper bounded by stochastically ordered Markov chains

@article{Montes2005,
abstract = {This paper deals with Markov decision processes (MDPs) with real state space for which its minimum is attained, and that are upper bounded by (uncontrolled) stochastically ordered (SO) Markov chains. We consider MDPs with (possibly) unbounded costs, and to evaluate the quality of each policy, we use the objective function known as the average cost. For this objective function we consider two Markov control models $\{\mathbb \{P\}\}$ and $\{\mathbb \{P\}\}_\{1\}$. $\mathbb \{P\}$ and $\{\mathbb \{P\}\}_\{1\}$ have the same components except for the transition laws. The transition $q$ of $\mathbb \{P\}$ is taken as unknown, and the transition $q_\{1\}$ of $\{\mathbb \{P\}\}_\{1\}$, as a known approximation of $q$. Under certain irreducibility, recurrence and ergodic conditions imposed on the bounding SO Markov chain (these conditions give the rate of convergence of the transition probability in $t$-steps, $t=1,2,\ldots $ to the invariant measure), the difference between the optimal cost to drive $\mathbb \{P\}$ and the cost obtained to drive $\mathbb \{P\}$ using the optimal policy of $\{\mathbb \{P\}\}_\{1\}$ is estimated. That difference is defined as the index of perturbations, and in this work upper bounds of it are provided. An example to illustrate the theory developed here is added.},
author = {Montes-de-Oca, Raúl, Salem-Silva, Francisco},
journal = {Kybernetika},
keywords = {stochastically ordered Markov chains; Lyapunov condition; invariant probability; average Markov decision processes; stochastically ordered Markov chains; Lyapunov condition; invariant probability},
language = {eng},
number = {6},
pages = {[757]-772},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Estimates for perturbations of average Markov decision processes with a minimal state and upper bounded by stochastically ordered Markov chains},
url = {http://eudml.org/doc/33786},
volume = {41},
year = {2005},
}

TY - JOUR
AU - Montes-de-Oca, Raúl
AU - Salem-Silva, Francisco
TI - Estimates for perturbations of average Markov decision processes with a minimal state and upper bounded by stochastically ordered Markov chains
JO - Kybernetika
PY - 2005
PB - Institute of Information Theory and Automation AS CR
VL - 41
IS - 6
SP - [757]
EP - 772
AB - This paper deals with Markov decision processes (MDPs) with real state space for which its minimum is attained, and that are upper bounded by (uncontrolled) stochastically ordered (SO) Markov chains. We consider MDPs with (possibly) unbounded costs, and to evaluate the quality of each policy, we use the objective function known as the average cost. For this objective function we consider two Markov control models ${\mathbb {P}}$ and ${\mathbb {P}}_{1}$. $\mathbb {P}$ and ${\mathbb {P}}_{1}$ have the same components except for the transition laws. The transition $q$ of $\mathbb {P}$ is taken as unknown, and the transition $q_{1}$ of ${\mathbb {P}}_{1}$, as a known approximation of $q$. Under certain irreducibility, recurrence and ergodic conditions imposed on the bounding SO Markov chain (these conditions give the rate of convergence of the transition probability in $t$-steps, $t=1,2,\ldots $ to the invariant measure), the difference between the optimal cost to drive $\mathbb {P}$ and the cost obtained to drive $\mathbb {P}$ using the optimal policy of ${\mathbb {P}}_{1}$ is estimated. That difference is defined as the index of perturbations, and in this work upper bounds of it are provided. An example to illustrate the theory developed here is added.
LA - eng
KW - stochastically ordered Markov chains; Lyapunov condition; invariant probability; average Markov decision processes; stochastically ordered Markov chains; Lyapunov condition; invariant probability
UR - http://eudml.org/doc/33786
ER -