Metraipolis › archive › dc_672f14808a4e

Monotone Inclusion Approach to Weakly Monotone Discrete-Time Finite-Horizon Mean-Field Games — arXiv:2608.15079

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15079
License (as archived)
CC0-1.0
Archived
2026-10-18T20:14:10.348Z
SHA-256 of the archived text
3e48f21b309b163f2ccb3b81eb124b8c69684ecc1a561d3d77d9e0cdde071a43
Stable URL of this page
https://metraipolis.com/documento/dc_672f14808a4e

How to cite

Monotone Inclusion Approach to Weakly Monotone Discrete-Time Finite-Horizon Mean-Field Games — arXiv:2608.15079 — arXiv (en), https://arxiv.org/abs/2608.15079 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_672f14808a4e (Metraipolis archive dc_672f14808a4e, sha256 3e48f21b309b163f2ccb3b81eb124b8c69684ecc1a561d3d77d9e0cdde071a43)
BibTeX
@misc{dc672f14808a4e,
  title = {Monotone Inclusion Approach to Weakly Monotone Discrete-Time Finite-Horizon Mean-Field Games — arXiv:2608.15079},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15079},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_672f14808a4e; sha256 3e48f21b309b163f2ccb3b81eb124b8c69684ecc1a561d3d77d9e0cdde071a43},
  year = {2026}
}

Archived text

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

We revisit the problem of computing mean-field equilibria (MFEs) in discrete-time, monotone, finite-horizon mean-field games (MFGs). We show that, when the transition kernel is independent of the state-measure term and the reward function satisfies the usual weak monotonicity condition and is Lipschitz continuous, anchored proximal gradient descent methods can be used to compute a monotone MFE. We also establish last-iterate convergence results for these methods. Our approach relies on formulating the computation problem as an optimization problem over the space of occupation measures. Using this formulation, we show that the problem is equivalent to a class of constrained Lipschitz monotone inclusion problems. We then apply iterative methods for this monotone inclusion formulation to derive a tractable algorithm. The resulting algorithm achieves a convergence rate of \(O(1/\sqrt{T})\) after \(T\) iterations, without requiring any regularization. This rate holds even in the absence of a uniqueness assumption for the corresponding MFE.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.15079 — 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-18T19:45:07.836Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).