Research map / Learning theory and algorithms / Submodular and game algorithms
Learning Regularized Monotone Graphon Mean-Field Games
Fengzhuo Zhang, Vincent Tan, Zhaoran Wang, Zhuoran Yang
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| approximate the GMFG with a mean-field game using constant graphons p in {0,0.5,1} (ablation) | MGMFG-PMD · Beach Bar, SBM and exp-graphon | exploitability | Hurt |
| use the unregularized PMD update instead of the discounted-past regularized update (ablation) | MGMFG-PMD · Beach Bar, lambda=1 | exploitability | Hurt |
| increase sampled agents and episodes from N=10,K=100 to N=10,K=300 in action-value estimation (ablation) | MGMFG-PMD · Beach Bar | exploitability | Improved |
| increase sampled agents from N=5 to N=10 with K=300 episodes (ablation) | MGMFG-PMD · Beach Bar | exploitability | Improved |
Closest papers by meaning
- Last-iterate Convergence in Regularized Graphon Mean Field Game (AAAI 2025 · similarity 0.93)
- Monotone Inclusion Approach to Weakly Monotone Discrete-Time Finite-Horizon Mean-Field Games (NeurIPS 2026 · similarity 0.89)
- Graphon Mean Field Games with a Representative Player: Analysis and Learning Algorithm (ICML 2024 · similarity 0.89)
- Last Iterate Convergence in Monotone Mean Field Games (NeurIPS 2025 · similarity 0.89)
- Learning Mean Field Games on Sparse Graphs: A Hybrid Graphex Approach (ICLR 2024 · similarity 0.88)
- Learning Discrete-Time Major-Minor Mean Field Games (AAAI 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
