Mathematics > Probability
[Submitted on 6 Aug 2021 (v1), last revised 27 Aug 2023 (this version, v2)]
Title:Large population games with interactions through controls and common noise: convergence results and equivalence between $open$--$loop$ and $closed$--$loop$ controls
View PDFAbstract:In the presence of a common noise, we study the convergence problems in mean field game (MFG) and mean field control (MFC) problem where the cost function and the state dynamics depend upon the joint conditional distribution of the controlled state and the control process. In the first part, we consider the MFG setting. We start by recalling the notions of $measure$--$valued$ MFG equilibria and of approximate $closed$--$loop$ Nash equilibria associated to the corresponding $N$--player game. Then, we show that all convergent sequences of approximate $closed$--$loop$ Nash equilibria, when $N \to \infty,$ converge to $measure$--$valued$ MFG equilibria. And conversely, any $measure$--$valued$ MFG equilibrium is the limit of a sequence of approximate $closed$--$loop$ Nash equilibria. In other words, $measure$--$valued$ MFG equilibria are the accumulation points of the approximate $closed$--$loop$ Nash equilibria. Previous work has shown that $measure$--$valued$ MFG equilibria are the accumulation points of the approximate $open$--$loop$ Nash equilibria. Therefore, we obtain that the limits of approximate $closed$--$loop$ Nash equilibria and approximate $open$--$loop$ Nash equilibria are the same. In the second part, we deal with the MFC setting. After recalling the $closed$--$loop$ and $open$--$loop$ formulations of the MFC problem, we prove that they are equivalent. We also provide some convergence results related to approximate $closed$--$loop$ Pareto equilibria.
Submission history
From: Mao Fabrice Djete [view email][v1] Fri, 6 Aug 2021 07:59:49 UTC (180 KB)
[v2] Sun, 27 Aug 2023 19:41:13 UTC (182 KB)
Current browse context:
math.PR
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.