Dynamic programming for non-additive stochastic objectives

We derive the existence of an optimum and the techniques of dynamic programming for non-additive stochastic objectives. Our key assumption for non-negative objectives is that asymptotic impatience exceeds asymptotic ‘mean’ growth, where ‘mean’ growth is derived not only from intertemporal inelasticity and the random return on investment but also from the curvature of the non-additive stochastic aggregator (i.e. the ‘certainty equivalent’). We provide broad families of new, interesting, and tractable examples. They illustrate that ‘mean’ growth can exist even when the distribution of returns has unbounded support, that power discounting often implies infinite asymptotic impatience, and that non-positive objectives are easily handled with few restrictions on growth.