Dynamic Programming with Recursive Preferences: Optimality and Applications

Guanlong Ren and John Stachurski

Papers from arXiv.org

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.

Date: 2018-12, Revised 2020-06
New Economics Papers: this item is included in nep-dge and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/1812.05748 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1812.05748

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().