Convex dynamic programming with (bounded) recursive utility
Gaetano Bloise and
Journal of Economic Theory, 2018, vol. 173, issue C, 118-141
We consider convex dynamic programs with general (bounded) recursive utilities. The Contraction Mapping Theorem fails when the utility aggregator does not obey any discounting property. This failure occurs even with traditional aggregators and certainty equivalent specifications. However, the Bellman operator admits a unique fixed point when an interior policy is feasible. This happens because utility values are unique at interior consumption plans and, when an interior perturbation is feasible, drops in utility values can be avoided.
Keywords: Recursive utility; Thompson aggregator; Bellman operator (search for similar items in EconPapers)
JEL-codes: C61 D81 D91 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:173:y:2018:i:c:p:118-141
Access Statistics for this article
Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell
More articles in Journal of Economic Theory from Elsevier
Bibliographic data for series maintained by Haili He ().