IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v112y2021icp84-97.html
   My bibliography  Save this article

Thompson aggregators, Scott continuous Koopmans operators, and Least Fixed Point theory

Author

Listed:
  • Becker, Robert A.
  • Rincón-Zapatero, Juan Pablo

Abstract

We reconsider the theory of Thompson aggregators proposed by Marinacci and Montrucchio (Marinacci and Montrucchio, 2010). We prove the existence of a Least Fixed Point (LFP) solution to the Koopmans equation. It is a recursive utility function. Our proof turns on demonstrating the Koopmans operator is a Scott continuous function when its domain is an order bounded subset of a space of bounded functions defined on the commodity space. Kleene’s Fixed Point Theorem yields the construction of the LFP by an iterative procedure. We argue the LFP solution is the Koopmans equation’s principal solution. It is constructed by an iterative procedure requiring less information (according to an information ordering) than approximations for any other fixed point. Additional distinctions between the LFP and GFP (Greatest Fixed Point) are presented. A general selection criterion for multiple solutions for functional equations and recursive methods is proposed.

Suggested Citation

  • Becker, Robert A. & Rincón-Zapatero, Juan Pablo, 2021. "Thompson aggregators, Scott continuous Koopmans operators, and Least Fixed Point theory," Mathematical Social Sciences, Elsevier, vol. 112(C), pages 84-97.
    • Handle: RePEc:eee:matsoc:v:112:y:2021:i:c:p:84-97
    DOI: 10.1016/j.mathsocsci.2021.03.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489621000354
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2021.03.015?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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. 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. V. Filipe Martins-da-Rocha & Yiannis Vailakis, 2013. "Fixed point for local contractions: Applications to recursive utility," International Journal of Economic Theory, The International Society for Economic Theory, vol. 9(1), pages 23-33, March.
    4. Vassilakis, Spyros, 1992. "Some economic applications of Scott domains," Mathematical Social Sciences, Elsevier, vol. 24(2-3), pages 173-208, November.
    5. Lucas, Robert Jr. & Stokey, Nancy L., 1984. "Optimal growth with many consumers," Journal of Economic Theory, Elsevier, vol. 32(1), pages 139-171, February.
    6. Massimo Marinacci & Luigi Montrucchio, 2019. "Unique Tarski Fixed Points," Management Science, INFORMS, vol. 44(4), pages 1174-1191, November.
    7. Bloise, Gaetano & Vailakis, Yiannis, 2018. "Convex dynamic programming with (bounded) recursive utility," Journal of Economic Theory, Elsevier, vol. 173(C), pages 118-141.
    8. Robert A. Becker & Juan Pablo Rincon-Zapatero, 2020. "Recursive Utility and Turnpike Theory for GMM Thompson Aggregators," CAEPR Working Papers 2020-001, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    9. Łukasz Balbus & Kevin Reffett & Łukasz Woźny, 2015. "Time consistent Markov policies in dynamic economies with quasi-hyperbolic consumers," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(1), pages 83-112, February.
    10. 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.
    11. Boud, John III, 1990. "Recursive utility and the Ramsey problem," Journal of Economic Theory, Elsevier, vol. 50(2), pages 326-345, April.
    12. Marinacci, Massimo & Montrucchio, Luigi, 2010. "Unique solutions for stochastic recursive utilities," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1776-1804, September.
    13. 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.
    14. Charalambos D. Aliprantis & Kim C. Border, 2006. "Infinite Dimensional Analysis," Springer Books, Springer, edition 0, number 978-3-540-29587-7, June.
    15. 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. 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).
    2. Boucekkine, Raouf & Seegmuller, Thomas & Venditti, Alain, 2021. "Advances in growth and macroeconomic dynamics: In memory of Carine Nourry," Mathematical Social Sciences, Elsevier, vol. 112(C), pages 1-6.

    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. Robert Becker & Juan Pablo Rincon-Zapatero, 2018. "Recursive Utility and Thompson Aggregators, I: Constructive Existence Theory for the Koopmans Equation," CAEPR Working Papers 2018-006, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    2. Robert A. Becker & Juan Pablo Rincón-Zapatero, 2017. "Arbitration and Renegotiation in Trade Agreements," CAEPR Working Papers 2017-007, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    3. Robert Becker & Juan Pablo Rincon-Zapatero, 2018. "Recursive Utility and Thompson Aggregators, II: Uniqueness of the Recursive Utility Representation," CAEPR Working Papers 2018-008, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
    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. Guanlong Ren & John Stachurski, 2018. "Dynamic Programming with Recursive Preferences: Optimality and Applications," Papers 1812.05748, arXiv.org, revised Jun 2020.
    6. Jaroslav Borovička & John Stachurski, 2020. "Necessary and Sufficient Conditions for Existence and Uniqueness of Recursive Utilities," Journal of Finance, American Finance Association, vol. 75(3), pages 1457-1493, June.
    7. Bloise, Gaetano & Vailakis, Yiannis, 2018. "Convex dynamic programming with (bounded) recursive utility," Journal of Economic Theory, Elsevier, vol. 173(C), pages 118-141.
    8. 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.
    9. 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.
    10. 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.
    11. Ł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.
    12. Thomas J. Sargent & John Stachurski, 2024. "Dynamic Programming: Finite States," Papers 2401.10473, arXiv.org.
    13. 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.
    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. 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.
    16. 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).
    17. Philippe Bich & Jean-Pierre Drugeon & Lisa Morhaim, 2015. "On Aggregators and Dynamic Programming," Post-Print halshs-01169552, HAL.
    18. Christensen, Timothy M., 2022. "Existence and uniqueness of recursive utilities without boundedness," Journal of Economic Theory, Elsevier, vol. 200(C).
    19. Ma, Qingyin & Stachurski, John & Toda, Alexis Akira, 2022. "Unbounded dynamic programming via the Q-transform," Journal of Mathematical Economics, Elsevier, vol. 100(C).
    20. Marinacci, Massimo & Montrucchio, Luigi, 2010. "Unique solutions for stochastic recursive utilities," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1776-1804, September.

    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:eee:matsoc:v:112:y:2021:i:c:p:84-97. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.