REVIEW 3 cited by
Dynamic Programming with Recursive Preferences: Optimality and Applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper provides new conditions for dynamic optimality in discrete time and uses them to establish fundamental dynamic programming results for several commonly used recursive preference specifications. These include Epstein-Zin preferences, risk-sensitive preferences, narrow framing models and recursive preferences with sensitivity to ambiguity. The results obtained for these applications include (i) existence of optimal policies, (ii) uniqueness of solutions to the Bellman equation, (iii) a complete characterization of optimal policies via Bellman's principle of optimality, and (iv) a globally convergent method of computation via value function iteration.
Forward citations
Cited by 3 Pith papers
-
The Endogenous Grid Method for Epstein-Zin Preferences
A power transformation W=V^(1-rho) makes the Epstein-Zin Euler equation invertible in closed form, yielding a root-finding-free endogenous grid method with large speed and accuracy gains.
-
History-Dependent Recursive Preferences in Markov Decision Processes
History-dependent recursive preferences have a canonical minimal preference-augmented state and Bellman recursion when certainty-equivalent richness and separability axioms hold.
-
Equilibrium in Production Chains with Multiple Upstream Partners
The paper extends the Kikuchi et al. (2018) production chain model to multiple upstream partners, proving uniqueness and global stability of equilibrium price via monotone concave operator theory, plus a fast grid alg...
Discussion (0). Continue with ORCID to comment.