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

Deterministic Dynamic Programming in Discrete Time: A Monotone Convergence Principle

Author

Listed:
  • Takashi Kamihigashi

    (Research Institute for Economics & Business Administration (RIEB), Kobe University, Japan)

  • Masayuki Yao

    (Graduate School of Economics, Keio University)

Abstract

We consider infinite-horizon deterministic dynamic programming problems in discrete time. We show that the value function is always a fixed point of a modified version of the Bellman operator. We also show that value iteration monotonically converges to the value function if the initial function is dominated by the value function, is mapped upward by the modified Bellman operator, and satisfies a transversality-like condition. These results require no assumption except for the general framework of infinite-horizon deterministic dynamic programming.

Suggested Citation

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

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. 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.
    2. Takashi Kamihigashi & Kevin Reffett & Masayuki Yao, 2014. "An Application of Kleene's Fixed Point Theorem to Dynamic Programming: A Note," Working Papers 2014-398, Department of Research, Ipag Business School.
    3. 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.
    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. 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. 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.
    7. 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.
    8. Alvarez, Fernando & Stokey, Nancy L., 1998. "Dynamic Programming with Homogeneous Functions," Journal of Economic Theory, Elsevier, vol. 82(1), pages 167-189, September.
    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. 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.

    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. 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.
    2. Takashi Kamihigashi & Masayuki Yao, 2016. "Infinite-Horizon Deterministic Dynamic Programming in Discrete Time: A Monotone Convergence Principle and a Penalty Method," Discussion Paper Series DP2016-05, Research Institute for Economics & Business Administration, Kobe University, revised May 2016.
    3. 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.
    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. 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.
    6. Agnieszka Wiszniewska-Matyszkiel & Rajani Singh, 2020. "When Inaccuracies in Value Functions Do Not Propagate on Optima and Equilibria," Mathematics, MDPI, vol. 8(7), pages 1-25, July.
    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. 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).
    9. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Post-Print halshs-01169552, HAL.
    10. 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.
    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. Anna Jaśkiewicz & Andrzej Nowak, 2011. "Stochastic Games with Unbounded Payoffs: Applications to Robust Control in Economics," Dynamic Games and Applications, Springer, vol. 1(2), pages 253-279, June.
    13. repec:cte:werepe:35342 is not listed on IDEAS
    14. Ma, Qingyin & Stachurski, John & Toda, Alexis Akira, 2022. "Unbounded dynamic programming via the Q-transform," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    15. 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.
    16. 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.
    17. Takashi Kamihigashi & Kevin Reffett & Masayuki Yao, 2014. "An Application of Kleene's Fixed Point Theorem to Dynamic Programming: A Note," Working Papers 2014-398, Department of Research, Ipag Business School.
    18. Takashi Kamihigashi & Cuong Le Van, 2015. "Necessary and Sufficient Conditions for a Solution of the Bellman Equation to be the Value Function: A General Principle," Post-Print halshs-01159177, HAL.
    19. Ronaldo Carpio & Takashi Kamihigashi, 2016. "Fast Bellman Iteration: An Application of Legendre-Fenchel Duality to Deterministic Dynamic Programming in Discrete Time," Discussion Paper Series DP2016-26, Research Institute for Economics & Business Administration, Kobe University.
    20. Bloise, Gaetano & Vailakis, Yiannis, 2018. "Convex dynamic programming with (bounded) recursive utility," Journal of Economic Theory, Elsevier, vol. 173(C), pages 118-141.
    21. Juan Pablo Rinc'on-Zapatero, 2019. "Existence and Uniqueness of Solutions to the Stochastic Bellman Equation with Unbounded Shock," Papers 1907.07343, arXiv.org.

    More about this item

    Keywords

    Dynamic Programming; Bellman Operator; Fixed Point; Value Iteration;
    All these keywords.

    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:dp2015-15. 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.