Learning Regularized Monotone Graphon Mean-Field Games
Not on the map. Why?
Abstract (arXiv)
This paper studies two fundamental problems in regularized Graphon Mean-Field Games (GMFGs). First, we establish the existence of a Nash Equilibrium (NE) of any λ-regularized GMFG (for λ≥ 0). This result relies on weaker conditions than those in previous works for analyzing both unregularized GMFGs (λ=0) and λ-regularized MFGs, which are special cases of GMFGs. Second, we propose provably efficient algorithms to learn the NE in weakly monotone GMFGs, motivated by Lasry and Lions [2007]. Previous literature either only analyzed continuous-time algorithms or required extra conditions to analyze discrete-time algorithms. In contrast, we design a discrete-time algorithm and derive its convergence rate solely under weakly monotone conditions. Furthermore, we develop and analyze the action-value function estimation procedure during the online learning process, which is absent from algorithms for monotone GMFGs. This serves as a sub-module in our optimization algorithm. The efficiency of the designed algorithm is corroborated by empirical evaluations.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 23 of its 44 references that are in the map. First posted on arXiv 12 Oct 2023.
Builds on
23 of 44 references.
References · 23
- 2017Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environmentscited by 1,519
- 2019A Theory of Regularized Markov Decision Processescited by 279
- 2021Bellman-consistent Pessimism for Offline Reinforcement Learningcited by 267
- 2017Emergence of Grounded Compositional Language in Multi-Agent Populationscited by 257
- 2019Provably Efficient Exploration in Policy Optimizationcited by 203
- 2020Fast Global Convergence of Natural Policy Gradient Methods with Entropy Regularizationcited by 170
- 2019Adaptive Trust Region Policy Optimization: Global Convergence and Faster Rates for Regularized MDPscited by 113
- 2022A Review of Off-Policy Evaluation in Reinforcement Learningcited by 92
- 2021Approximately Solving Mean Field Games via Entropy-Regularized Deep Reinforcement Learningcited by 65
- 2020Fictitious Play for Mean Field Games: Continuous Time Analysis and Applicationscited by 57
- 2021Concave Utility Reinforcement Learning: the Mean-Field Game Viewpointcited by 54
- 2020Q-Learning in Regularized Mean-field Gamescited by 40
11 more
- 2021Scaling up Mean Field Games with Online Mirror Descentcited by 29
- 2021Learning Graphon Mean Field Games and Approximate Nash Equilibriacited by 28
- 2022Policy Mirror Ascent for Efficient and Independent Learning in Mean Field Gamescited by 24
- 2020Mean Field Games and Applications: Numerical Aspectscited by 22
- 2020Breaking the Curse of Many Agents: Provable Mean Embedding Q-Iteration for Mean-Field Reinforcement Learningcited by 19
- 2022Oracle-free Reinforcement Learning in Mean-Field Games along a Single Sample Pathcited by 16
- 2022Learning Sparse Graphon Mean Field Gamescited by 14
- 2019Stochastic Graphon Games: I. The Static Casecited by 12
- 2021Finite State Graphon Games with Applications to Epidemicscited by 9
- 2018Graphon games: A statistical framework for network games and interventionscited by 8
- 2020Master equation of discrete time graphon mean field games and teamscited by 3
Built on by
Citing papers per year: 2024: 4; 2025: 3; 2026: 1.
8 papers.
- 2024Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RLcited by 9
- 2024MF-OML: Online Mean-Field Reinforcement Learning with Occupation Measures for Large Population Gamescited by 5
- 2024Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithmcited by 5
- 2025Learning Mean Field Control on Sparse Graphscited by 2
- 2025Convergence and Connectivity: Dynamics of Multi-Agent Q-Learning in Random Networkscited by 1
- 2025Policy Optimization for Continuous-time Linear-Quadratic Graphon Mean Field Gamescited by 1
- 2024Last Iterate Convergence in Monotone Mean Field Gamescited by 0
- 2026Mean-Field Control on Sparse Graphs: From Local Limits to GNNs via Neighborhood Distributionscited by 0
- 2026Mean-Field Control on Sparse Graphs: From Local Limits to GNNs via Neighborhood Distributions29 Jan 2026
- 2025Policy Optimization for Continuous-time Linear-Quadratic Graphon Mean Field Games6 Jun 2025
- 2025Convergence and Connectivity: Dynamics of Multi-Agent Q-Learning in Random Networks13 Mar 2025
- 2025Learning Mean Field Control on Sparse Graphs28 Jan 2025
- 2024Last Iterate Convergence in Monotone Mean Field Games7 Oct 2024
- 2024Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm8 May 2024
- 2024MF-OML: Online Mean-Field Reinforcement Learning with Occupation Measures for Large Population Games1 May 2024
- 2024Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL8 Feb 2024