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

On maximin dynamic programming and the rate of discount

Author

Listed:
  • 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, PJSE - Paris Jourdan Sciences Economiques - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - INRA - Institut National de la Recherche Agronomique - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique)

  • Thai Ha-Huy

    (EPEE - Centre d'Etudes des Politiques Economiques - UEVE - Université d'Évry-Val-d'Essonne, TIMAS - Institute of Mathematics and Applied Science)

  • Thi Do Hanh Nguyen

    (VMU - Vietnam Maritime University [Hai Phon])

Abstract

This article establishes a dynamic programming argument for a maximin optimization problem where the agent completes a minimization over a set of discount rates. Even though the consideration of a maximin criterion results in a program that is not convex and not stationary over time, it is proved that a careful reference to extended dynamic programming principles and a maxmin functional equation however allows for circumventing these difficulties and recovering an optimal sequence that is time consistent.

Suggested Citation

  • Jean-Pierre Drugeon & Thai Ha-Huy & Thi Do Hanh Nguyen, 2019. "On maximin dynamic programming and the rate of discount," PSE-Ecole d'économie de Paris (Postprint) halshs-02096484, HAL.
    • Handle: RePEc:hal:pseptp:halshs-02096484
    DOI: 10.1007/s00199-018-1166-0
    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 & 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. 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.
    3. Amir, Rabah, 1996. "Sensitivity analysis of multisector optimal economic dynamics," Journal of Mathematical Economics, Elsevier, vol. 25(1), pages 123-141.
    4. Jean-Pierre Drugeon & Thai Ha Huy, 2022. "A not so myopic axiomatization of discounting," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 73(1), pages 349-376, February.
    5. Katsutoshi Wakai, 2013. "Intertemporal Utility Smoothing: Theory And Applications," The Japanese Economic Review, Japanese Economic Association, vol. 64(1), pages 16-41, March.
    6. 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.
    7. 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.
    8. Gilboa, Itzhak & Schmeidler, David, 1989. "Maxmin expected utility with non-unique prior," Journal of Mathematical Economics, Elsevier, vol. 18(2), pages 141-153, April.
    9. Katsutoshi Wakai, 2008. "A Model of Utility Smoothing," Econometrica, Econometric Society, vol. 76(1), pages 137-153, January.
    10. 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.
    11. 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.
    12. Christopher P. Chambers & Federico Echenique, 2018. "On Multiple Discount Rates," Econometrica, Econometric Society, vol. 86(4), pages 1325-1346, July.
    13. 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.
    14. Alvarez, Fernando & Stokey, Nancy L., 1998. "Dynamic Programming with Homogeneous Functions," Journal of Economic Theory, Elsevier, vol. 82(1), pages 167-189, September.
    15. Geoffard, Pierre-Yves, 1996. "Discounting and Optimizing: Capital Accumulation Problems as Variational Minmax Problems," Journal of Economic Theory, Elsevier, vol. 69(1), pages 53-70, April.
    16. 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.
    17. Streufert, Peter A., 1992. "An abstract topological approach to dynamic programming," Journal of Mathematical Economics, Elsevier, vol. 21(1), pages 59-88.
    18. 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)

    Citations

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


    Cited by:

    1. Mononen, Lasse, 2024. "Dynamically Consistent Intergenerational Welfare," Center for Mathematical Economics Working Papers 687, Center for Mathematical Economics, Bielefeld University.
    2. Sokolov, Mikhail V., 2024. "NPV, IRR, PI, PP, and DPP: A unified view," Journal of Mathematical Economics, Elsevier, vol. 114(C).
    3. Łukasz Balbus, 2020. "On recursive utilities with non-affine aggregator and conditional certainty equivalent," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 551-577, September.
    4. Ha-Huy, Thai & Nguyen, Thi Tuyet Mai, 2022. "Saving and dissaving under Ramsey–Rawls criterion," Journal of Mathematical Economics, Elsevier, vol. 103(C).
    5. Thai Ha-Huy & Tuyet Mai Nguyen, 2019. "Optimal growth and Ramsey-Rawls criteria," Documents de recherche 19-02, Centre d'Études des Politiques Économiques (EPEE), Université d'Evry Val d'Essonne.
    6. Eisei Ohtaki, 2023. "Optimality in an OLG model with nonsmooth preferences," International Journal of Economic Theory, The International Society for Economic Theory, vol. 19(3), pages 611-659, September.
    7. Ha-Huy, Thai, 2022. "A tale of two Rawlsian criteria," Mathematical Social Sciences, Elsevier, vol. 118(C), pages 30-35.
    8. Antoine Riche & Francesco Magris & Daria Onori, 2020. "Monetary rules in a two-sector endogenous growth model," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 69(4), pages 1049-1100, June.
    9. Rabah Amir, 2019. "Supermodularity and Complementarity in Economic Theory," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 67(3), pages 487-496, April.
    10. Mononen, Lasse, 2024. "Dynamically Consistent Intertemporal Dual-Self Expected Utility," Center for Mathematical Economics Working Papers 686, Center for Mathematical Economics, Bielefeld University.
    11. Drugeon, Jean-Pierre & Ha-Huy, Thai, 2021. "On Multiple Discount Rates with Recursive Time-Dependent Orders," MPRA Paper 111308, University Library of Munich, Germany.

    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, 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.
    2. 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.
    3. 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.
    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. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Post-Print halshs-01169552, HAL.
    6. 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.
    7. Balbus, Łukasz & Reffett, Kevin & Woźny, Łukasz, 2022. "Time-consistent equilibria in dynamic models with recursive payoffs and behavioral discounting," Journal of Economic Theory, Elsevier, vol. 204(C).
    8. 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.
    9. 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.
    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. Jean-Pierre Drugeon & Thai Ha-Huy & Thi-Do-Hanh Nguyen, 2018. "On Maximin Optimization Problems & the Rate of Discount: a Simple Dynamic Programming Argument," Working Papers halshs-01761997, HAL.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. Ha-Huy, Thai, 2022. "A tale of two Rawlsian criteria," Mathematical Social Sciences, Elsevier, vol. 118(C), pages 30-35.
    17. 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.
    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. Łukasz Balbus, 2020. "On recursive utilities with non-affine aggregator and conditional certainty equivalent," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(2), pages 551-577, September.
    20. John Stachurski, 2009. "Economic Dynamics: Theory and Computation," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262012774, December.

    More about this item

    Keywords

    Policy function; Supermodularity; Value function; Non-convexities; Maximin principle;
    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:pseptp:halshs-02096484. 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: Caroline Bauer (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.