Computing [(g,w)]-Optimal Policies in Discrete and Continuous Markov Programs.

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-...