cs.LGFeb 13, 2026

Bench-MFG: A Benchmark Suite for Learning in Stationary Mean Field Games

Authors: Lorenzo Magnino, Jiacheng Shen, Matthieu Geist, Olivier Pietquin, Mathieu Laurière

Organizations: University of Cambridge · NYU Shanghai · NYU Center for Data Science · Earth Species Project · 

Abstract

The rise of Mean Field Games (MFGs) has fostered a growing family of algorithms designed to solve large-scale multi-agent systems. However, the field currently lacks a standardized evaluation protocol, forcing researchers to rely on bespoke, isolated, and often simplistic environments. This fragmentation makes it difficult to assess the robustness, generalization, and failure modes of emerging methods. To address this gap, we propose a comprehensive benchmark suite for MFGs, focusing on the discrete-time, discrete-space, stationary setting. We introduce a taxonomy of problem classes, ranging from no-interaction and monotone games to potential and dynamics-coupled games, and provide prototypical environments for each. Furthermore, we present MF-Garnets, a method for generating random MFG instances to facilitate rigorous statistical testing. We benchmark a variety of learning algorithms across these environments, including a novel population-based approach (MF-PSO). To our knowledge, this is the first benchmark for MFGs.

Figures & tables

Appendix figures & tables18 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Learning Large-Scale Competitive Team Behaviors with Mean-Field Interactions

    Apr 29, 2025Bhavini Jeloka, Yue Guan, Panagiotis TsiotrasMean-Field MARLMulti-Agent Reinforcement Learning

  2. Recurrent Structural Policy Gradient for Partially Observable Mean Field Games

    Feb 23, 2026Clarisse Wibault, Johannes Forkel, Sebastian Towers +9Mean Field GamesPolicy Gradient Methods