Dynamic programming with state-dependent discounting

From MaRDI portal
Publication:1995327




Abstract: This paper extends the core results of discrete time infinite horizon dynamic programming to the case of state-dependent discounting. We obtain a condition on the discount factor process under which all of the standard optimality results can be recovered. We also show that the condition cannot be significantly weakened. Our framework is general enough to handle complications such as recursive preferences and unbounded rewards. Economic and financial applications are discussed.



Cites work







This page was built for publication: Dynamic programming with state-dependent discounting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1995327)