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

On Aggregators and Dynamic Programming

Author

Listed:
  • Philippe Bich

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, 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 des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

  • Jean-Pierre Drugeon

    (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 des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

  • Lisa Morhaim

    (CRED - Centre de Recherche en Economie et Droit - UP2 - Université Panthéon-Assas)

Abstract

In the tradition of Irving Fisher, the current article advocates an approach to dynamic programming that is based upon elementary aggregating functions where current action and future expected payoff combine to yield overall current payoff. Some regularity properties are provided on the aggregator which allow for establishing the existence, the uniqueness and the computation of the Bellman equation. Some order-theoretic foundations for such aggregators are also established. The aggregator line of argument encompasses and generalizes many previous results based upon additive or non-additive recursive payoff functions.

Suggested Citation

  • Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Post-Print halshs-01169552, HAL.
    • Handle: RePEc:hal:journl:halshs-01169552
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-01169552
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-01169552/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    4. Levin, V. L., 1991. "Some applications of set-valued mappings in mathematical economics," Journal of Mathematical Economics, Elsevier, vol. 20(1), pages 69-87.
    5. 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.
    6. 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.
    7. Juan Rincón-Zapatero & Carlos Rodríguez-Palmero, 2007. "Recursive utility with unbounded aggregators," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 33(2), pages 381-391, November.
    8. 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.
    9. Alvarez, Fernando & Stokey, Nancy L., 1998. "Dynamic Programming with Homogeneous Functions," Journal of Economic Theory, Elsevier, vol. 82(1), pages 167-189, September.
    10. Takashi Kamihigashi, 2011. "Existence and Uniqueness of a Fixed Point for the Bellman Operator in Deterministic Dynamic Programming," Discussion Paper Series DP2011-23, Research Institute for Economics & Business Administration, Kobe University.
    11. Boud, John III, 1990. "Recursive utility and the Ramsey problem," Journal of Economic Theory, Elsevier, vol. 50(2), pages 326-345, April.
    12. 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.
    13. Streufert, Peter A., 1992. "An abstract topological approach to dynamic programming," Journal of Mathematical Economics, Elsevier, vol. 21(1), pages 59-88.
    14. 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)

    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. 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.
    2. 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.
    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. 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. 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. Bloise, Gaetano & Vailakis, Yiannis, 2018. "Convex dynamic programming with (bounded) recursive utility," Journal of Economic Theory, Elsevier, vol. 173(C), pages 118-141.
    7. 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.
    8. 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.
    9. 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.
    10. Ma, Qingyin & Stachurski, John & Toda, Alexis Akira, 2022. "Unbounded dynamic programming via the Q-transform," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. repec:cte:werepe:35342 is not listed on IDEAS
    16. Takashi Kamihigashi & Masayuki Yao, 2015. "Infnite-Horizon Deterministic Dynamic Programming in Discrete Time: A Monotone Convergence Principle," Discussion Paper Series DP2015-32, Research Institute for Economics & Business Administration, Kobe University.
    17. 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.
    18. 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.
    19. 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.
    20. John Stachurski, 2009. "Economic Dynamics: Theory and Computation," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262012774, April.
    21. 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.

    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:halshs-01169552. 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.