IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v50y2025i3p1762-1831.html
   My bibliography  Save this article

Exploration Noise for Learning Linear-Quadratic Mean Field Games

Author

Listed:
  • François Delarue

    (CNRS, LJAD, Université Côte d’Azur, 06108 Nice Cedex 2, France)

  • Athanasios Vasileiadis

    (CNRS, LJAD, Université Côte d’Azur, 06108 Nice Cedex 2, France)

Abstract

The goal of this paper is to demonstrate that common noise may serve as an exploration noise for learning the solution of a mean field game. This concept is here exemplified through a toy linear-quadratic model, for which a suitable form of common noise has already been proven to restore existence and uniqueness. We here go one step further and prove that the same form of common noise may force the convergence of the learning algorithm called fictitious play, and this without any further potential or monotone structure. Several numerical examples are provided to support our theoretical analysis.

Suggested Citation

  • François Delarue & Athanasios Vasileiadis, 2025. "Exploration Noise for Learning Linear-Quadratic Mean Field Games," Mathematics of Operations Research, INFORMS, vol. 50(3), pages 1762-1831, August.
  • Handle: RePEc:inm:ormoor:v:50:y:2025:i:3:p:1762-1831
    DOI: 10.1287/moor.2021.0157
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.0157
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.0157?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    JEL classification:

    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:inm:ormoor:v:50:y:2025:i:3:p:1762-1831. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.