IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v173y2018icp118-141.html
   My bibliography  Save this article

Convex dynamic programming with (bounded) recursive utility

Author

Listed:
  • Bloise, Gaetano
  • Vailakis, Yiannis

Abstract

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.

Suggested Citation

  • Bloise, Gaetano & Vailakis, Yiannis, 2018. "Convex dynamic programming with (bounded) recursive utility," Journal of Economic Theory, Elsevier, vol. 173(C), pages 118-141.
    • Handle: RePEc:eee:jetheo:v:173:y:2018:i:c:p:118-141
    DOI: 10.1016/j.jet.2017.10.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022053117301217
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jet.2017.10.008?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. John Stachurski, 2009. "Economic Dynamics: Theory and Computation," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262012774, April.
    2. Takashi Kamihigashi, 2014. "Elementary results on solutions to the bellman equation of dynamic programming: existence, uniqueness, and convergence," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(2), pages 251-273, June.
    3. Le Van, Cuong & Vailakis, Yiannis, 2005. "Recursive utility and optimal growth with bounded or unbounded returns," Journal of Economic Theory, Elsevier, vol. 123(2), pages 187-209, August.
    4. Jorge Durán, 2003. "Discounting long run average growth in stochastic dynamic programs," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 22(2), pages 395-413, September.
    5. David K. Backus & Bryan R. Routledge & Stanley E. Zin, 2005. "Exotic Preferences for Macroeconomists," NBER Chapters, in: NBER Macroeconomics Annual 2004, Volume 19, pages 319-414, National Bureau of Economic Research, Inc.
    6. Larry G. Epstein & Stanley E. Zin, 2013. "Substitution, risk aversion and the temporal behavior of consumption and asset returns: A theoretical framework," World Scientific Book Chapters, in: Leonard C MacLean & William T Ziemba (ed.), HANDBOOK OF THE FUNDAMENTALS OF FINANCIAL DECISION MAKING Part I, chapter 12, pages 207-239, World Scientific Publishing Co. Pte. Ltd..
    7. Le Van, Cuong & Morhaim, Lisa, 2002. "Optimal Growth Models with Bounded or Unbounded Returns: A Unifying Approach," Journal of Economic Theory, Elsevier, vol. 105(1), pages 158-187, July.
    8. Rustichini, Aldo, 1998. "Dynamic Programming Solution of Incentive Constrained Problems," Journal of Economic Theory, Elsevier, vol. 78(2), pages 329-354, February.
    9. Ozaki, Hiroyuki & Streufert, Peter A., 1996. "Dynamic programming for non-additive stochastic objectives," Journal of Mathematical Economics, Elsevier, vol. 25(4), pages 391-442.
    10. Boud, John III, 1990. "Recursive utility and the Ramsey problem," Journal of Economic Theory, Elsevier, vol. 50(2), pages 326-345, April.
    11. Marinacci, Massimo & Montrucchio, Luigi, 2010. "Unique solutions for stochastic recursive utilities," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1776-1804, September.
    12. Lucas, Robert Jr. & Stokey, Nancy L., 1984. "Optimal growth with many consumers," Journal of Economic Theory, Elsevier, vol. 32(1), pages 139-171, February.
    13. Jorge DurÂn, 2000. "On dynamic programming with unbounded returns," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 15(2), pages 339-352.
    14. V. Filipe Martins-da-Rocha & Yiannis Vailakis, 2010. "Existence and Uniqueness of a Fixed Point for Local Contractions," Econometrica, Econometric Society, vol. 78(3), pages 1127-1141, May.
    15. Streufert, Peter A., 1992. "An abstract topological approach to dynamic programming," Journal of Mathematical Economics, Elsevier, vol. 21(1), pages 59-88.
    16. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2018. "On Temporal Aggregators and Dynamic Programming," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01437496, HAL.
    17. Kreps, David M & Porteus, Evan L, 1978. "Temporal Resolution of Uncertainty and Dynamic Choice Theory," Econometrica, Econometric Society, vol. 46(1), pages 185-200, January.
    18. Charalambos D. Aliprantis & Kim C. Border, 2006. "Infinite Dimensional Analysis," Springer Books, Springer, edition 0, number 978-3-540-29587-7, January.
    19. Peter A. Streufert, 1990. "Stationary Recursive Utility and Dynamic Programming under the Assumption of Biconvergence," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 57(1), pages 79-97.
    20. Massimo Marinacci & Luigi Montrucchio, 2017. "Unique Tarski Fixed Points," Working Papers 604, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
    21. Cuong Le Van & Yiannis Vailakis, 2005. "Recursive utility and optimal growth with bounded or unbounded returns," Post-Print halshs-00101201, HAL.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Luca De Gennaro Aquino & Sascha Desmettre & Yevhen Havrylenko & Mogens Steffensen, 2024. "Equilibrium control theory for Kihlstrom-Mirman preferences in continuous time," Papers 2407.16525, arXiv.org, revised Oct 2024.
    2. Jaroslav Borovička & John Stachurski, 2020. "Necessary and Sufficient Conditions for Existence and Uniqueness of Recursive Utilities," Journal of Finance, American Finance Association, vol. 75(3), pages 1457-1493, June.
    3. Becker, Robert A. & Rincón-Zapatero, Juan Pablo, 2021. "Thompson aggregators, Scott continuous Koopmans operators, and Least Fixed Point theory," Mathematical Social Sciences, Elsevier, vol. 112(C), pages 84-97.
    4. Yu, Meng & Zhang, Junnan, 2019. "Equilibrium in production chains with multiple upstream partners," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 1-10.
    5. Bloise, G. & Van, C. Le & Vailakis, Y., 2024. "An approximation approach to dynamic programming with unbounded returns," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    6. Meng Yu & Junnan Zhang, 2019. "Equilibrium in Production Chains with Multiple Upstream Partners," Papers 1908.08208, arXiv.org.
    7. Massimo Marinacci & Luigi Montrucchio, 2019. "Unique Tarski Fixed Points," Management Science, INFORMS, vol. 44(4), pages 1174-1191, November.
    8. Robert Becker & Juan Pablo Rincon-Zapatero, 2018. "Recursive Utility and Thompson Aggregators, I: Constructive Existence Theory for the Koopmans Equation," CAEPR Working Papers 2018-006, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    9. Guanlong Ren & John Stachurski, 2018. "Dynamic Programming with Recursive Preferences: Optimality and Applications," Papers 1812.05748, arXiv.org, revised Jun 2020.
    10. Thomas J. Sargent & John Stachurski, 2024. "Dynamic Programming: Finite States," Papers 2401.10473, arXiv.org.
    11. Łukasz Balbus, 2020. "On recursive utilities with non-affine aggregator and conditional certainty equivalent," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 551-577, September.
    12. Massimo Marinacci & Luigi Montrucchio, 2017. "Unique Tarski Fixed Points," Working Papers 604, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
    13. Christensen, Timothy M., 2022. "Existence and uniqueness of recursive utilities without boundedness," Journal of Economic Theory, Elsevier, vol. 200(C).
    14. Kikuchi, Tomoo & Nishimura, Kazuo & Stachurski, John & Zhang, Junnan, 2021. "Coase meets Bellman: Dynamic programming for production networks," Journal of Economic Theory, Elsevier, vol. 196(C).
    15. Robert Becker & Juan Pablo Rincon-Zapatero, 2018. "Recursive Utility and Thompson Aggregators, II: Uniqueness of the Recursive Utility Representation," CAEPR Working Papers 2018-008, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    16. Timothy M. Christensen, 2020. "Existence and uniqueness of recursive utilities without boundedness," Papers 2008.00963, arXiv.org, revised Aug 2021.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bloise, G. & Van, C. Le & Vailakis, Y., 2024. "An approximation approach to dynamic programming with unbounded returns," Journal of Mathematical Economics, Elsevier, vol. 111(C).
    2. Guanlong Ren & John Stachurski, 2018. "Dynamic Programming with Recursive Preferences: Optimality and Applications," Papers 1812.05748, arXiv.org, revised Jun 2020.
    3. Jaroslav Borovička & John Stachurski, 2020. "Necessary and Sufficient Conditions for Existence and Uniqueness of Recursive Utilities," Journal of Finance, American Finance Association, vol. 75(3), pages 1457-1493, June.
    4. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2018. "On temporal aggregators and dynamic programming," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 66(3), pages 787-817, October.
    5. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2018. "On Temporal Aggregators and Dynamic Programming," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01437496, HAL.
    6. Bäuerle, Nicole & Jaśkiewicz, Anna, 2018. "Stochastic optimal growth model with risk sensitive preferences," Journal of Economic Theory, Elsevier, vol. 173(C), pages 181-200.
    7. Masayuki Yao, 2016. "Recursive Utility and the Solution to the Bellman Equation," Discussion Paper Series DP2016-08, Research Institute for Economics & Business Administration, Kobe University.
    8. Gaetano Bloise & Cuong Le Van & Yiannis Vailakis, 2024. "Do not Blame Bellman: It Is Koopmans' Fault," Econometrica, Econometric Society, vol. 92(1), pages 111-140, January.
    9. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01169552, HAL.
    10. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Post-Print halshs-01169552, HAL.
    11. Łukasz Balbus, 2020. "On recursive utilities with non-affine aggregator and conditional certainty equivalent," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 551-577, September.
    12. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Documents de travail du Centre d'Economie de la Sorbonne 15053, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    13. Robert A. Becker & Juan Pablo Rincón-Zapatero, 2017. "Arbitration and Renegotiation in Trade Agreements," CAEPR Working Papers 2017-007, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    14. Balbus, Łukasz & Reffett, Kevin & Woźny, Łukasz, 2022. "Time-consistent equilibria in dynamic models with recursive payoffs and behavioral discounting," Journal of Economic Theory, Elsevier, vol. 204(C).
    15. Anna Jaśkiewicz & Janusz Matkowski & Andrzej Nowak, 2014. "On variable discounting in dynamic programming: applications to resource extraction and other economic models," Annals of Operations Research, Springer, vol. 220(1), pages 263-278, September.
    16. Ozaki, Hiroyuki & Streufert, Peter A., 1996. "Dynamic programming for non-additive stochastic objectives," Journal of Mathematical Economics, Elsevier, vol. 25(4), pages 391-442.
    17. Becker, Robert A. & Rincón-Zapatero, Juan Pablo, 2021. "Thompson aggregators, Scott continuous Koopmans operators, and Least Fixed Point theory," Mathematical Social Sciences, Elsevier, vol. 112(C), pages 84-97.
    18. Robert Becker & Juan Pablo Rincon-Zapatero, 2018. "Recursive Utility and Thompson Aggregators, II: Uniqueness of the Recursive Utility Representation," CAEPR Working Papers 2018-008, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    19. Robert Becker & Juan Pablo Rincon-Zapatero, 2018. "Recursive Utility and Thompson Aggregators, I: Constructive Existence Theory for the Koopmans Equation," CAEPR Working Papers 2018-006, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    20. Marinacci, Massimo & Montrucchio, Luigi, 2010. "Unique solutions for stochastic recursive utilities," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1776-1804, September.

    More about this item

    Keywords

    Recursive utility; Thompson aggregator; Bellman operator;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • D81 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Criteria for Decision-Making under Risk and Uncertainty
    • D91 - Microeconomics - - Micro-Based Behavioral Economics - - - Role and Effects of Psychological, Emotional, Social, and Cognitive Factors on Decision Making

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:173:y:2018:i:c:p:118-141. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622869 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.