arXiv · 1908.08800
Dynamic Programming with State-Dependent Discounting
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
John Stachurski, Junnan Zhang. 2020-10-14. Dynamic Programming with State-Dependent Discounting. https://arxiv.org/abs/1908.08800
Cite the original work for its findings. Save a collection to share your selection of sources.