On Dynamic Programming with Unbounded Rewards

Using the technique employed by the author in an earlier paper, the existence of an optimal stationary policy that can be obtained from the usual functional equation is again established in the presence of a bound (not necessarily polynomial) on the one-period reward of a semi-Markov decision process. This is done for both the discounted and the average cost case. In addition to allowing an uncountable state space, the law of motion of the system is rather general in that we permit any state to be reached in a single transition. There is, however, a bound on a weighted moment of the next state reached. Finally, we indicate the applicability of these results.

• 저널Management Science · 21(11) · 1225–1233
• 토픽Economic theories and models · Economics and Econometrics
• DOI10.1287/mnsc.21.11.1225
• 저자Steven A. Lippman