Computing (G,W)-Optimal Policies in Discrete and Continuous Markov Programs

摘要

The study shows how to compute policies that maximize a certain reasonable criterion (i.e., policies that are (g,w)-optimal) for the undiscounted infinite-horizon versions of two Markov decision problems--one a discrete-time model and the other a continuous-time model. The approach used is to parse the overall problem into at most three smaller problems that can be solved in sequence by the methods of linear programming or policy iteration. (Author)