Multi-Population Mean Field Games

• Multi-Population Mean Field Games are systems that analyze interactions among different agent populations with diverse dynamics and cost structures via coupled FBSDEs and PDEs.
• The framework employs Hamilton–Jacobi–Bellman and Fokker–Planck equations to derive Nash and cooperative equilibria, ensuring rigorous solutions for heterogeneous interactions.
• Applications span economics, finance, and engineered networks, where approximation theory and propagation of chaos guarantee near-optimal performance in large-scale systems.

Multi-population Mean Field Games (MP-MFGs) generalize the mean field game paradigm to settings with several interacting subpopulations, each comprising a large number of statistically similar agents that may differ in dynamics, cost structures, initial distributions, and strategic incentives. The core feature of MP-MFGs is the interplay of intra-population interactions (among agents of the same group) and inter-population couplings (via control, state, or distributional dependencies) that can include both competitive and cooperative structures. MP-MFGs are formalized mathematically via systems of coupled forward-backward stochastic differential equations (FBSDEs), or equivalently, through Hamilton–Jacobi–Bellman (HJB) and Fokker–Planck (FP) partial differential equations (PDEs), and they admit a range of probabilistic, analytic, and variational representations.

1. Mathematical Structure of Multi-Population MFGs

Multi-population MFGs are typically defined for $K$ populations indexed by $k=1,\dots,K$, with each population $k$ described by a (possibly vector-valued) flow of probability measures $\mu^k_t$ on state space $\mathbb{R}^d$. The evolution for a representative agent in population $i$ is governed by the McKean–Vlasov SDE

$$dX^i_t = b_i(t,X^i_t,\mu^1_t,\ldots, \mu^K_t, \alpha^i_t)\,dt + \sigma_i(t,X^i_t,\mu^1_t,\ldots, \mu^K_t)\,dW^i_t,\quad X^i_0\sim\mu_0^i,$$

where $\alpha^i_t\in A_i$ is an admissible control, and $W^i_t$ is an independent Brownian motion for each population (Fujii, 2019, Nam et al., 2024). The control problem (cost) for an agent in population $i$ takes the form

$k=1,\dots,K$0

The agent's optimal controls and the resulting empirical measures are coupled through a self-consistency condition: in Nash-type MP-MFGs, $k=1,\dots,K$1 must equal the law of $k=1,\dots,K$2 under equilibrium feedback. Extensions to discrete time and more general state/action spaces are formalized analogously (Więcek, 2023, Cont et al., 17 Feb 2025).

2. Forward–Backward Systems and Equilibrium Concepts

MP-MFG equilibria are characterized by a system of coupled FBSDEs of the form

$k=1,\dots,K$3

where the Hamiltonian $k=1,\dots,K$4 incorporates both running cost and controlled drift, and $k=1,\dots,K$5 is the pointwise minimizer of $k=1,\dots,K$6 in the control variable (Fujii, 2019, Nam et al., 2024). This setup enables three broad classes of interaction mechanisms:

1. Fully non-cooperative: All agents are strategic, leading to a Nash equilibrium determined by the matching between empirical laws and the individual distribution of controlled states.
2. Intra-population cooperation: All agents within each population act as a coalition to optimize a common objective, formalized via mean field type control (MFTC) problems.
3. Mixed regime: Some populations are internally cooperative (MFTC), while others are Nash non-cooperative, leading to hybrid FBSDE or master equation systems (Fujii, 2019, Bensoussan et al., 2018).

These characterizations extend to Markov and stationary equilibria for discrete-time MP-MFGs (Więcek, 2023), allowing for both discounted and total-payoff criteria.

3. Regime Taxonomy and Analytical Results

A central insight from (Fujii, 2019, Bensoussan et al., 2018, Laurière, 7 Nov 2025), and (Więcek, 2023) is the need for a regime taxonomy, based on intra- and inter-population cooperation/competition. The following table summarizes these:

Regime	Equilibrium Type	Coupling Structure	Mathematical Characterization
Non-cooperative	Nash MFG	Cross-population distributions	Coupled FBSDEs, HJB–FP systems
Intra-pop. cooperation	MFTC	Cross-pop, own-pop. through measures	FBSDEs w/ measure derivatives
Mixed regime	MFG–MFTC hybrid	Both above, population-dependent	FBSDEs + master equation terms

Existence and (where applicable) uniqueness of MP-MFG equilibria are established under combinations of:

• Uniform Lipschitz continuity and growth conditions in state and control variables,
• Convexity in the Hamiltonian with respect to controls,
• Lipschitz or continuity properties in measure arguments (Wasserstein topology),
• Sufficient regularity in initial data and transition kernels.

Schauder’s fixed-point theorem is often used, leveraging compactness of the set of candidate measure flows and continuity of equilibrium map (Fujii, 2019, Nam et al., 2024).

4. Approximation Theory and Propagation of Chaos

A key property is that MP-MFG equilibria provide approximate Nash equilibria—$k=1,\dots,K$7-Nash—for large finite-population ($k=1,\dots,K$8-player) games. Given certain regularity and coupling assumptions, it is shown that the empirical distributions of particle systems controlled by mean-field feedbacks converge in the $k=1,\dots,K$9-Wasserstein metric at $k$0 or sharper rates, and that no individual agent can gain more than $k$1 by unilateral deviation (Fujii, 2019, Cont et al., 17 Feb 2025).

For heterogeneous populations partitioned into $k$2 subgroups, mean-field homogenization results provide explicit non-asymptotic bounds on the gap between finite-player Nash equilibria and their multi-population MFG approximations, quantifying both finite-size and within-group heterogeneity errors (Cont et al., 17 Feb 2025). Optimal clustering of agents into near-homogeneous sub-populations, as captured by a mixed-integer program, minimizes approximation error.

5. PDE, Variational, and Computational Representations

Under sufficient smoothness, the probabilistic FBSDE characterization can be recast as a coupled system of HJB–Fokker–Planck PDEs: $k$3 with $k$4 minimizing the corresponding Hamiltonian (Fujii, 2019, Laurière, 7 Nov 2025). Variational formulations (Eulerian and Lagrangian, using entropy regularization) have been developed to address multi-population systems with non-local interactions and critical mass exponents, offering both theoretical and computation-friendly perspectives (Pascale et al., 2024, Kong et al., 27 Jan 2025).

For large-scale discrete models, iterative methods such as Online Mirror Descent (OMD) have been shown to converge efficiently to Nash equilibria under monotonicity conditions, handling high-dimensional state spaces and multiple populations (Perolat et al., 2021).

6. Applications and Advanced Directions

MP-MFGs arise in a broad array of applications, including but not limited to: heterogeneous agent systems in economics/finance (Li et al., 19 Nov 2025), engineered networks, competing social groups, resource management, crowd and mobility models (Arjmand et al., 2021), and regulatory regimes (e.g., major–minor player games with networked interactions among populations and regulators) (Dayanikli et al., 2023).

Contemporary developments encompass:

• Discrete-time MP-MFG models with rigorous existence theory under minimal continuity and compactness conditions (Więcek, 2023).
• Extensions to incorporate major agents, "teams" structures, graphon or network couplings, Stackelberg and other hierarchical regimes (Subramanian et al., 2023, Laurière, 7 Nov 2025).
• Nonlocal and possibly non-convex coupling with convergence guarantees via $k$5-convergence and entropic regularization (Pascale et al., 2024).
• Master equation and non-Markovian frameworks required for coalition-level competition, which cannot be closed at the PDE/FBSDE level (Bensoussan et al., 2018).

MP-MFGs thus provide a comprehensive framework for the tractable analysis of large interacting agent systems with group, coalition, or population heterogeneity, bridging probabilistic, analytic, and computational methodologies. Their theoretical depth and versatility have led to rapid expansion in both mathematical theory and real-world modeling (Fujii, 2019, Cont et al., 17 Feb 2025, Nam et al., 2024, Laurière, 7 Nov 2025).