IDEAS home Printed from https://ideas.repec.org/p/kob/dpaper/dp2016-08.html
   My bibliography  Save this paper

Recursive Utility and the Solution to the Bellman Equation

Author

Listed:
  • Masayuki Yao

    (Research Associate (Non-tenured), Department of Economics, Keio University)

Abstract

This study infinite-horizon deterministic dynamic programming problems based on recursive utility in discrete time. Under a small number of conditions, we show that the Bellman operator has a fixed point using Knaster-Tarski's fixed point theorem. We also show the fixed point of the Bellman operator can be computed by iteration from the initial function between the lower boundary and the fixed point. To show the convergence theorem, we use Tarski-Kantorovitch's fixed point theorem.

Suggested Citation

  • 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.
    • Handle: RePEc:kob:dpaper:dp2016-08
    as

    Download full text from publisher

    File URL: https://www.rieb.kobe-u.ac.jp/academic/ra/dp/English/DP2016-08.pdf
    File Function: First version, 2016
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Lucas, Robert Jr. & Stokey, Nancy L., 1984. "Optimal growth with many consumers," Journal of Economic Theory, Elsevier, vol. 32(1), pages 139-171, February.
    3. Takashi Kamihigashi & Kevin Reffett & Masayuki Yao, 2015. "An application of Kleene's fixed point theorem to dynamic programming," International Journal of Economic Theory, The International Society for Economic Theory, vol. 11(4), pages 429-434, December.
    4. Takashi Kamihigashi, 2008. "On the principle of optimality for nonstationary deterministic dynamic programming," International Journal of Economic Theory, The International Society for Economic Theory, vol. 4(4), pages 519-525, December.
    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. Ozaki, Hiroyuki & Streufert, Peter A., 1996. "Dynamic programming for non-additive stochastic objectives," Journal of Mathematical Economics, Elsevier, vol. 25(4), pages 391-442.
    7. Fisher, Irving, 1907. "The Rate of Interest," History of Economic Thought Books, McMaster University Archive for the History of Economic Thought, number fisher1907.
    8. Robert A. Becker, 1980. "On the Long-Run Steady State in a Simple Dynamic Model of Equilibrium with Heterogeneous Households," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 95(2), pages 375-382.
    9. 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.
    10. Takashi Kamihigashi & Masayuki Yao, 2015. "Deterministic Dynamic Programming in Discrete Time: A Monotone Convergence Principle," Discussion Paper Series DP2015-15, Research Institute for Economics & Business Administration, Kobe University.
    11. Rose-Anne Dana & Cuong Le Van & Tapan Mitra & Kazuo Nishimura (ed.), 2006. "Handbook on Optimal Growth 1," Springer Books, Springer, number 978-3-540-32310-5, December.
    12. Epstein, Larry G & Hynes, J Allan, 1983. "The Rate of Time Preference and Dynamic Economic Analysis," Journal of Political Economy, University of Chicago Press, vol. 91(4), pages 611-635, August.
    13. Boud, John III, 1990. "Recursive utility and the Ramsey problem," Journal of Economic Theory, Elsevier, vol. 50(2), pages 326-345, April.
    14. Streufert, Peter A., 1992. "An abstract topological approach to dynamic programming," Journal of Mathematical Economics, Elsevier, vol. 21(1), pages 59-88.
    15. Charalambos D. Aliprantis & Kim C. Border, 2006. "Infinite Dimensional Analysis," Springer Books, Springer, edition 0, number 978-3-540-29587-7, December.
    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. 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.
    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.

    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, Gaetano & Vailakis, Yiannis, 2018. "Convex dynamic programming with (bounded) recursive utility," Journal of Economic Theory, Elsevier, vol. 173(C), pages 118-141.
    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. 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.
    4. 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).
    5. Guanlong Ren & John Stachurski, 2018. "Dynamic Programming with Recursive Preferences: Optimality and Applications," Papers 1812.05748, arXiv.org, revised Jun 2020.
    6. 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.
    7. 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.
    8. 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.
    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. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Post-Print halshs-01169552, HAL.
    11. 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.
    12. 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.
    13. Jean-Paul Chavas, 2004. "On Impatience, Economic Growth and the Environmental Kuznets Curve: A Dynamic Analysis of Resource Management," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 28(2), pages 123-152, June.
    14. Farmer, Roger E.A. & Lahiri, Amartya, 2005. "Recursive preferences and balanced growth," Journal of Economic Theory, Elsevier, vol. 125(1), pages 61-77, November.
    15. Toda, Alexis Akira, 2014. "Incomplete market dynamics and cross-sectional distributions," Journal of Economic Theory, Elsevier, vol. 154(C), pages 310-348.
    16. 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.
    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. Takashi Kamihigashi, 2014. "An order-theoretic approach to dynamic programming: an exposition," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 2(1), pages 13-21, April.
    19. Ma, Qingyin & Stachurski, John & Toda, Alexis Akira, 2022. "Unbounded dynamic programming via the Q-transform," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    20. 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.

    More about this item

    Keywords

    Recursive utility; Fixed point theorem; Dynamic programming; Bellman equation;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • O41 - Economic Development, Innovation, Technological Change, and Growth - - Economic Growth and Aggregate Productivity - - - One, Two, and Multisector Growth Models

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:kob:dpaper:dp2016-08. 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: Office of Promoting Research Collaboration, Research Institute for Economics & Business Administration, Kobe University (email available below). General contact details of provider: https://edirc.repec.org/data/rikobjp.html .

    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.