Abstract and Applied Analysis
Volume 2009 (2009), Article ID 103723, 17 pages
Research Article

Policy Iteration for Continuous-Time Average Reward Markov Decision Processes in Polish Spaces

1Department of Mathematics, Ningbo University, Ningbo 315211, China
2Department of Mathematics, Honghe University, Mengzi 661100, China
3The College of Mathematics and Computing Science, Changsha University of Science and Technology, Changsha 410076, China

Received 24 June 2009; Accepted 9 December 2009

Academic Editor: Nikolaos Papageorgiou

Copyright © 2009 Quanxin Zhu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We study the policy iteration algorithm (PIA) 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. The criterion that we are concerned with is expected average reward. We propose a set of conditions under which we first establish the average reward optimality equation and present the PIA. Then under two slightly different sets of conditions we show that the PIA yields the optimal (maximum) reward, an average optimal stationary policy, and a solution to the average reward optimality equation.