The $n$th-Order Bias Optimality for Multichain Markov Decision Processes

2008 ◽  
Vol 53 (2) ◽  
pp. 496-508 ◽  
Author(s):  
Xi-Ren Cao ◽  
Junyu Zhang
2008 ◽  
Vol 45 (02) ◽  
pp. 417-429 ◽  
Author(s):  
Quanxin Zhu ◽  
Tomás Prieto-Rumeau

In this paper we study the bias and the overtaking optimality criteria for continuous-time jump Markov decision processes in general state and action spaces. The corresponding transition rates are allowed to be unbounded, and the reward rates may have neither upper nor lower bounds. Under appropriate hypotheses, we prove the existence of solutions to the bias optimality equations, the existence of bias optimal policies, and an equivalence relation between bias and overtaking optimality.


2008 ◽  
Vol 45 (2) ◽  
pp. 417-429 ◽  
Author(s):  
Quanxin Zhu ◽  
Tomás Prieto-Rumeau

In this paper we study the bias and the overtaking optimality criteria for continuous-time jump Markov decision processes in general state and action spaces. The corresponding transition rates are allowed to be unbounded, and the reward rates may have neither upper nor lower bounds. Under appropriate hypotheses, we prove the existence of solutions to the bias optimality equations, the existence of bias optimal policies, and an equivalence relation between bias and overtaking optimality.


Sign in / Sign up

Export Citation Format

Share Document