IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v6y2016i3d10.1007_s13235-015-0160-4.html
   My bibliography  Save this article

Robust Mean Field Games

Author

Listed:
  • Dario Bauso

    (Università di Palermo)

  • Hamidou Tembine

    (Ecole Supérieure d’Electricité, Supelec)

  • Tamer Başar

    (University of Illinois at Urbana-Champaign)

Abstract

Recently there has been renewed interest in large-scale games in several research disciplines, with diverse application domains as in the smart grid, cloud computing, financial markets, biochemical reaction networks, transportation science, and molecular biology. Prior works have provided rich mathematical foundations and equilibrium concepts but relatively little in terms of robustness in the presence of uncertainties. In this paper, we study mean field games with uncertainty in both states and payoffs. We consider a population of players with individual states driven by a standard Brownian motion and a disturbance term. The contribution is threefold: First, we establish a mean field system for such robust games. Second, we apply the methodology to production of an exhaustible resource. Third, we show that the dimension of the mean field system can be significantly reduced by considering a functional of the first moment of the mean field process.

Suggested Citation

  • Dario Bauso & Hamidou Tembine & Tamer Başar, 2016. "Robust Mean Field Games," Dynamic Games and Applications, Springer, vol. 6(3), pages 277-303, September.
    • Handle: RePEc:spr:dyngam:v:6:y:2016:i:3:d:10.1007_s13235-015-0160-4
    DOI: 10.1007/s13235-015-0160-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-015-0160-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13235-015-0160-4?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. Sergiu Hart, 2013. "Adaptive Heuristics," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 11, pages 253-287, World Scientific Publishing Co. Pte. Ltd..
    2. Sergiu Hart & Andreu Mas-Colell, 2013. "A General Class Of Adaptive Strategies," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 3, pages 47-76, World Scientific Publishing Co. Pte. Ltd..
    3. Jovanovic, Boyan & Rosenthal, Robert W., 1988. "Anonymous sequential games," Journal of Mathematical Economics, Elsevier, vol. 17(1), pages 77-87, February.
    4. Xavier Spinat, 2002. "A Necessary and Sufficient Condition for Approachability," Mathematics of Operations Research, INFORMS, vol. 27(1), pages 31-44, February.
    5. Sergiu Hart & Andreu Mas-Colell, 2013. "Regret-Based Continuous-Time Dynamics," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 5, pages 99-124, World Scientific Publishing Co. Pte. Ltd..
    6. Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
    7. Lehrer, Ehud, 2003. "A wide range no-regret theorem," Games and Economic Behavior, Elsevier, vol. 42(1), pages 101-115, January.
    8. Ehud Lehrer & Eilon Solan, 2006. "Excludability and Bounded Computational Capacity," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 637-648, August.
    9. Hamidou Tembine & Quanyan Zhu & Tamer Basar, 2011. "Risk-sensitive mean field stochastic differential games," Post-Print hal-00643547, HAL.
    10. Diogo Gomes & João Saúde, 2014. "Mean Field Games Models—A Brief Survey," Dynamic Games and Applications, Springer, vol. 4(2), pages 110-154, June.
    11. Nicolas Vieille, 1992. "Weak Approachability," Post-Print hal-00481891, HAL.
    12. Lehrer, Ehud & Solan, Eilon, 2009. "Approachability with bounded memory," Games and Economic Behavior, Elsevier, vol. 66(2), pages 995-1004, July.
    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. Ferrari, Giorgio & Tzouanas, Ioannis, 2025. "Stationary Mean-Field Games of Singular Control under Knightian Uncertainty," Center for Mathematical Economics Working Papers 706, Center for Mathematical Economics, Bielefeld University.
    2. Mouhamadou Samsidy Goudiaby & Ben Mansour Dia & Mamadou L. Diagne & Hamidou Tembine, 2021. "Cooperative Game for Fish Harvesting and Pollution Control," Games, MDPI, vol. 12(3), pages 1-21, August.
    3. Jun Moon & Tamer Başar, 2019. "Risk-Sensitive Mean Field Games via the Stochastic Maximum Principle," Dynamic Games and Applications, Springer, vol. 9(4), pages 1100-1125, December.

    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. Karl Schlag & Andriy Zapechelnyuk, 2010. "On the Impossibility of Regret Minimization in Repeated Games," Working Papers 676, Queen Mary University of London, School of Economics and Finance.
    2. Karl Schlag & Andriy Zapechelnyuk, 2010. "On the Impossibility of Regret Minimization in Repeated Games," Working Papers 676, Queen Mary University of London, School of Economics and Finance.
    3. Karl Schlag & Andriy Zapechelnyuk, 2009. "Decision Making in Uncertain and Changing Environments," Discussion Papers 19, Kyiv School of Economics.
    4. Andriy Zapechelnyuk, 2009. "Limit Behavior of No-regret Dynamics," Discussion Papers 21, Kyiv School of Economics.
    5. Schlag, Karl & Zapechelnyuk, Andriy, 2012. "On the impossibility of achieving no regrets in repeated games," Journal of Economic Behavior & Organization, Elsevier, vol. 81(1), pages 153-158.
    6. Mannor, Shie & Shimkin, Nahum, 2008. "Regret minimization in repeated matrix games with variable stage duration," Games and Economic Behavior, Elsevier, vol. 63(1), pages 227-258, May.
    7. Schlag, Karl H. & Zapechelnyuk, Andriy, 2017. "Dynamic benchmark targeting," Journal of Economic Theory, Elsevier, vol. 169(C), pages 145-169.
    8. Foster, Dean P. & Hart, Sergiu, 2018. "Smooth calibration, leaky forecasts, finite recall, and Nash dynamics," Games and Economic Behavior, Elsevier, vol. 109(C), pages 271-293.
    9. Germano, Fabrizio & Lugosi, Gabor, 2007. "Global Nash convergence of Foster and Young's regret testing," Games and Economic Behavior, Elsevier, vol. 60(1), pages 135-154, July.
    10. repec:hal:wpaper:hal-00713871 is not listed on IDEAS
    11. Viossat, Yannick & Zapechelnyuk, Andriy, 2013. "No-regret dynamics and fictitious play," Journal of Economic Theory, Elsevier, vol. 148(2), pages 825-842.
    12. Du, Ye & Lehrer, Ehud, 2020. "Constrained no-regret learning," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 16-24.
    13. Lehrer, Ehud & Solan, Eilon, 2009. "Approachability with bounded memory," Games and Economic Behavior, Elsevier, vol. 66(2), pages 995-1004, July.
    14. Michel Benaïm & Josef Hofbauer & Sylvain Sorin, 2006. "Stochastic Approximations and Differential Inclusions, Part II: Applications," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 673-695, November.
    15. Stoltz, Gilles & Lugosi, Gabor, 2007. "Learning correlated equilibria in games with compact sets of strategies," Games and Economic Behavior, Elsevier, vol. 59(1), pages 187-208, April.
    16. Ludovico Crippa & Yonatan Gur & Bar Light, 2025. "Equilibria under Dynamic Benchmark Consistency in Non-Stationary Multi-Agent Systems," Papers 2501.11897, arXiv.org, revised May 2025.
    17. Fournier, Gaëtan & Kuperwasser, Eden & Munk, Orin & Solan, Eilon & Weinbaum, Avishay, 2021. "Approachability with constraints," European Journal of Operational Research, Elsevier, vol. 292(2), pages 687-695.
    18. Andrey Bernstein & Shie Mannor & Nahum Shimkin, 2014. "Opportunistic Approachability and Generalized No-Regret Problems," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1057-1083, November.
    19. Ludovico Crippa & Yonatan Gur & Bar Light, 2022. "Equilibria in Repeated Games under No-Regret with Dynamic Benchmarks," Papers 2212.03152, arXiv.org, revised Jan 2025.
    20. Ehud Lehrer & Eilon Solan, 2007. "Learning to play partially-specified equilibrium," Levine's Working Paper Archive 122247000000001436, David K. Levine.
    21. Sergiu Hart & Andreu Mas-Colell, 2013. "A Simple Adaptive Procedure Leading To Correlated Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 2, pages 17-46, World Scientific Publishing Co. Pte. Ltd..

    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:spr:dyngam:v:6:y:2016:i:3:d:10.1007_s13235-015-0160-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.