IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/halshs-00101201.html
   My bibliography  Save this paper

Recursive utility and optimal growth with bounded or unbounded returns

Author

Listed:
  • Cuong Le Van

    (CERMSEM - CEntre de Recherche en Mathématiques, Statistique et Économie Mathématique - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Yiannis Vailakis

    (UCL IRES - Institut de recherches économiques et sociales - UCL - Université Catholique de Louvain = Catholic University of Louvain)

Abstract

In this paper, we propose a unifying approach to the study of recursive economic problems. Postulating an aggregator function as the fundamental expression of tastes, we explore conditions under which a utility function can be constructed. We also modify the usual dynamic programming arguments to include this class of models. We show that Bellman's equation still holds, so many results known for the additively separable case can be generalized for this general description of preferences. Our approach is general, allowing for both bounded and unbounded returns. Many recursive economic models studied in the literature are particular cases of our setting.

Suggested Citation

  • Cuong Le Van & Yiannis Vailakis, 2005. "Recursive utility and optimal growth with bounded or unbounded returns," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00101201, HAL.
    • Handle: RePEc:hal:cesptp:halshs-00101201
    DOI: 10.1016/j.jet.2004.06.007
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. Dana, Rose-Anne & Van, Cuong Le, 1991. "Optimal growth and Pareto optimality," Journal of Mathematical Economics, Elsevier, vol. 20(2), pages 155-180.
    3. 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..
    4. Lucas, Robert Jr. & Stokey, Nancy L., 1984. "Optimal growth with many consumers," Journal of Economic Theory, Elsevier, vol. 32(1), pages 139-171, February.
    5. 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.
    6. Juan Pablo RincÛn-Zapatero & Carlos RodrÌguez-Palmero, 2003. "Existence and Uniqueness of Solutions to the Bellman Equation in the Unbounded Case," Econometrica, Econometric Society, vol. 71(5), pages 1519-1555, September.
    7. Alvarez, Fernando & Stokey, Nancy L., 1998. "Dynamic Programming with Homogeneous Functions," Journal of Economic Theory, Elsevier, vol. 82(1), pages 167-189, September.
    8. Boud, John III, 1990. "Recursive utility and the Ramsey problem," Journal of Economic Theory, Elsevier, vol. 50(2), pages 326-345, April.
    9. 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.
    10. Epstein, Larry G., 1983. "Stationary cardinal utility and optimal growth under uncertainty," Journal of Economic Theory, Elsevier, vol. 31(1), pages 133-152, October.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    3. Bloise, Gaetano & Vailakis, Yiannis, 2018. "Convex dynamic programming with (bounded) recursive utility," Journal of Economic Theory, Elsevier, vol. 173(C), pages 118-141.
    4. 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.
    5. Cuong Le Van & Lisa Morhaim & Yiannis Vailakis, 2008. "Monotone Concave Operators: An application to the existence and uniqueness of solutions to the Bellman equation," Working Papers hal-00294828, HAL.
    6. Cuong Le Van & Lisa Morhaim & Yiannis Vailakis, 2008. "Monotone Concave Operators: An application to the existence and uniqueness of solutions to the Bellman equation," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00294828, HAL.
    7. 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.
    8. 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.
    9. 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.
    10. Ozaki, Hiroyuki & Streufert, Peter A., 1996. "Dynamic programming for non-additive stochastic objectives," Journal of Mathematical Economics, Elsevier, vol. 25(4), pages 391-442.
    11. 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.
    12. Suen, Richard M. H., 2009. "Bounding the CRRA Utility Functions," MPRA Paper 13260, University Library of Munich, Germany.
    13. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Post-Print halshs-01169552, HAL.
    14. Jean-Pierre Drugeon & Thai Ha-Huy & Thi Do Hanh Nguyen, 2019. "On maximin dynamic programming and the rate of discount," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 67(3), pages 703-729, April.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Nicole Bauerle & Anna Ja'skiewicz, 2015. "Stochastic Optimal Growth Model with Risk Sensitive Preferences," Papers 1509.05638, arXiv.org.
    20. 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.

    More about this item

    Keywords

    Recursive utility; dynamic programming; Bellman equation; unbounded returns;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • D90 - Microeconomics - - Micro-Based Behavioral Economics - - - General

    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:hal:cesptp:halshs-00101201. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.