IDEAS home Printed from https://ideas.repec.org/a/spr/dyngam/v14y2024i2d10.1007_s13235-023-00492-0.html
   My bibliography  Save this article

Planning Problem for Continuous-Time Finite State Mean Field Game with Compact Action Space

Author

Listed:
  • Yurii Averboukh

    (Higher School of Economics
    Krasovskii Institute of Mathematics and Mechanics)

  • Aleksei Volkov

    (Krasovskii Institute of Mathematics and Mechanics)

Abstract

The planning problem for the mean field game implies that one tries to transfer the system of infinitely many identical rational agents from the given distribution to the final one using the choice of the terminal payoff. It can be formulated as the mean field game system with the boundary condition only on the distribution. In the paper, we consider the continuous-time finite state mean field game, assuming that the space of actions for each player is compact. It is shown that the planning problem in this case may not admit a solution even if the final distribution is reachable from the initial one. Further, we introduce the concept of generalized solution of the planning problem for the finite state mean field game based on the minimization of regret of a fictitious player. This minimal regret solution always exists. Additionally, the set of minimal regret solution is the closure of the set of classical solution of the planning problem, provided that the latter is nonempty. Finally, we examine the uniqueness of the solution to the planning problem using the Lasry–Lions monotonicity arguments.

Suggested Citation

  • Yurii Averboukh & Aleksei Volkov, 2024. "Planning Problem for Continuous-Time Finite State Mean Field Game with Compact Action Space," Dynamic Games and Applications, Springer, vol. 14(2), pages 285-303, May.
    • Handle: RePEc:spr:dyngam:v:14:y:2024:i:2:d:10.1007_s13235-023-00492-0
    DOI: 10.1007/s13235-023-00492-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13235-023-00492-0
    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-023-00492-0?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.

    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:14:y:2024:i:2:d:10.1007_s13235-023-00492-0. 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: 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.