Metraipolis › archive › dc_e17acc0befdc

Learning controls in mean field games: the fictitious play and related gradient descent — arXiv:2610.06292

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.06292
License (as archived)
CC0-1.0
Archived
2026-10-06T13:06:35.738Z
SHA-256 of the archived text
e73e0ad77e9e72e2d1b6de41b47b33ad4ec52af8ad23f2ed75b00e3e3cb692aa
Stable URL of this page
https://metraipolis.com/documento/dc_e17acc0befdc

How to cite

Learning controls in mean field games: the fictitious play and related gradient descent — arXiv:2610.06292 — arXiv (en), https://arxiv.org/abs/2610.06292 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e17acc0befdc (Metraipolis archive dc_e17acc0befdc, sha256 e73e0ad77e9e72e2d1b6de41b47b33ad4ec52af8ad23f2ed75b00e3e3cb692aa)
BibTeX
@misc{dce17acc0befdc,
  title = {Learning controls in mean field games: the fictitious play and related gradient descent — arXiv:2610.06292},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.06292},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e17acc0befdc; sha256 e73e0ad77e9e72e2d1b6de41b47b33ad4ec52af8ad23f2ed75b00e3e3cb692aa},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06292. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We investigate two learning procedures and their relationship to the formation of equilibrium in potential mean field games (MFGs). The first one is a version of the fictitious play in which players observe directly the actions (controls) of other players and learn the distribution of the MFG through an update rules on controls. This leads to a new iterative procedure which converges for a wide class of potential MFGs of controls, even in the presence of common noise. On the other hand we also consider the learning procedure of a principal agent trying to solve a mean field control problem with only local gradient information. We prove that under very general assumption, the gradient descent of such agent converges to a solution of the associated potential MFG.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2610.06292 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T11:21:31.923Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).