2025/11/07 by Laurière, Mathieu
Decision Sciences · Physics and Astronomy · Social Sciences · #Anonymity #Computer Science and Game Theory (cs.GT) #Evolutionary Game Theory and Cooperation #FOS: Computer and information sciences #FOS: Mathematics #Field (mathematics) #Game Theory and Applications #Game theory #Homogeneity (statistics) #Key (lock) #Meaning (existential) #Opinion Dynamics and Social Influence #Optimization and Control (math.OC)
paper · open access · doi:10.48550/arxiv.2511.04929
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2025/11/07 · openalex created_date 2025/11/11 · openalex updated_date 2026/07/28
The mean field games (MFG) paradigm was introduced to provide tractable approximations of games involving very large populations. The theory typically rests on two key assumptions: homogeneity, meaning that all players share the same dynamics and cost functions, and anonymity, meaning that each player interacts with others only through their empirical distribution. While these assumptions simplify the analysis, they can be restrictive for many applications. Fortunately, several extensions of the standard MFG framework that relax these assumptions have been developed in the literature. The purpose of these notes is to offer a pedagogical introduction to such models. In particular, we discuss multi-population MFGs, graphon MFGs, major-minor MFGs, and Stackelberg MFGs, as well as variants involving cooperative players.