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

An approximation approach to dynamic programming with unbounded returns

Author

Listed:
  • Gaetano Bloise

    (University of Rome II)

  • Cuong Le Van

    (PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École nationale des ponts et chaussées - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement, IPAG Business School)

  • Yiannis Vailakis

    (University of Glasgow)

Abstract

We study stochastic dynamic programming with recursive utility in settings where multiplicity of values is only attributed to unbounded returns. That is, we consider Koopmans aggregators that, when artificially restricted to be bounded, satisfy the traditional Blackwell's discounting condition (as it certainly happens with time-additive aggregators). We argue that, when the truncation is removed, the sequence of truncated values converges to the relevant fixed point of the untruncated Bellman operator, whenever it exists, and diverges otherwise. The experiment provides a natural selection criterion, corresponding to an extension of the recursive utility from bounded to unbounded returns.

Suggested Citation

  • Gaetano Bloise & Cuong Le Van & Yiannis Vailakis, 2024. "An approximation approach to dynamic programming with unbounded returns," Post-Print hal-04934128, HAL.
    • Handle: RePEc:hal:journl:hal-04934128
    DOI: 10.1016/j.jmateco.2024.102954
    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.

    More about this item

    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:journl:hal-04934128. 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: 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.