IDEAS home Printed from https://ideas.repec.org/p/cpm/cepmap/0101.html

Discounting long run average growth in stochastic dynamic programs

Author

Listed:
  • Duran, Jorge

Abstract

Finding solutions to the Bellman equation relies on restrictive boundedness assumptions. The literature on endogenous growth or business cycle models with unbounded random shocks provide with numerous examples of recursive programs in which returns are not bounded along feasible paths. In this paper we develop a method of proof that allows to account for models of this type. In applications our assumptions only imply that long run average (expected) growth is sufficiently discounted, in sharp contrast with classical assumptons either absolutely bounding growth or bounding each period (instead of long run) maximum (instead of average) growth. We discuss our work in relation to the literature and provide several examples.

Suggested Citation

  • Duran, Jorge, 2001. "Discounting long run average growth in stochastic dynamic programs," CEPREMAP Working Papers (Couverture Orange) 0101, CEPREMAP.
    • Handle: RePEc:cpm:cepmap:0101
    as

    Download full text from publisher

    File URL: http://www.cepremap.fr/depot/couv_orange/co0101.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

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


    Cited by:

    1. is not listed on IDEAS
    2. 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).
    3. Lores, Francisco Xavier, 2001. "Cyclical behaviour of consumption of non-durable goods: Spain versus U.S.A," UC3M Working papers. Economics we014710, Universidad Carlos III de Madrid. Departamento de Economía.
    4. 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.
    5. Kamihigashi, Takashi, 2007. "Stochastic optimal growth with bounded or unbounded utility and with bounded or unbounded shocks," Journal of Mathematical Economics, Elsevier, vol. 43(3-4), pages 477-500, April.
    6. Paweł Dziewulski, 2011. "On Time-to-Build Economies with Multiple-Stage Investments," Gospodarka Narodowa. The Polish Journal of Economics, Warsaw School of Economics, issue 9, pages 23-49.
    7. Janusz Matkowski & Andrzej Nowak, 2011. "On discounted dynamic programming with unbounded returns," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 46(3), pages 455-474, April.
    8. Dziewulski, Paweł, . "On time-to-build economies with multiple stage investments," Gospodarka Narodowa-The Polish Journal of Economics, Szkoła Główna Handlowa w Warszawie / SGH Warsaw School of Economics, vol. 2011(9).
    9. Łukasz Balbus & Anna Jaśkiewicz & Andrzej S. Nowak, 2020. "Equilibria in Altruistic Economic Growth Models," Dynamic Games and Applications, Springer, vol. 10(1), pages 1-18, March.
    10. Bloise, Gaetano & Vailakis, Yiannis, 2018. "Convex dynamic programming with (bounded) recursive utility," Journal of Economic Theory, Elsevier, vol. 173(C), pages 118-141.
    11. Alexis Akira Toda, 2024. "Unbounded Markov dynamic programming with weighted supremum norm Perov contractions," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 12(2), pages 141-156, December.

    More about this item

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:cpm:cepmap:0101. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sébastien Villemot (email available below). General contact details of provider: https://edirc.repec.org/data/ceprefr.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.