Dynamic Programming with State-Dependent Discounting
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Perov's Contraction Principle and Dynamic Programming with Stochastic Discounting
This paper shows the usefulness of Perov's contraction principle, which generalizes Banach's contraction principle to a vector-valued metric, for studying dynamic programming problems in which the discount factor can be …
AdaGamma: State-Dependent Discounting for Temporal Adaptation in Reinforcement Learning
The discount factor in reinforcement learning controls both the effective planning horizon and the strength of bootstrapping, yet most deep RL methods use a single fixed value across all states. While state-dependent dis…
Reinforcement LearningBeyond the Bellman Recursion: A Pontryagin-Guided Framework for Non-Exponential Discounting
Most value-based and actor--critic reinforcement learning methods rely on Bellman-style recursions, yet these recursions collapse under non-exponential discounting common in human preferences and survival processes. We s…
Reinforcement LearningExamining average and discounted reward optimality criteria in reinforcement learning
In reinforcement learning (RL), the goal is to obtain an optimal policy, for which the optimality criterion is fundamentally important. Two major optimality criteria are average and discounted rewards. While the latter i…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Relating Reinforcement Learning to Dynamic Programming-Based Planning
This paper bridges some of the gap between optimal planning and reinforcement learning (RL), both of which share roots in dynamic programming applied to sequential decision making or optimal control. Whereas planning typ…
Reinforcement LearningDecision Making