Discounting long run average growth in stochastic dynamic programs

Finding solutions to the Bellman equation often relies on restrictive boundedness assumptions. In this paper we develop a method of proof that allows to dispense with the assumption that returns are bounded from above. In applications our assumptions only imply that long run average (expected) growth is sufficiently discounted, in sharp contrast with classical assumptions either absolutely bounding growth or bounding each period (instead of long run) maximum (instead of average) growth. We discuss our work in relation to the literature and provide several examples. Copyright Springer-Verlag Berlin Heidelberg 2003