Abstract

For countable-state decision processes (dynamic programming problems), a general class of objective functions is identified for which it is shown that good Markov strategies always exist. This class includes product and lim inf rewards, as well as practically all the classical dynamic programming expected payoff functions.

Disciplines

Mathematics

Included in

Mathematics Commons

Share

COinS
 

URL: http://digitalcommons.calpoly.edu/rgp_rsr/49