Mean-Field Games Under Model Uncertainty
Not on the map. Why?
Abstract (arXiv)
We study discrete-time, finite-state mean-field games (MFGs) under model uncertainty, where agents face ambiguity about the state transition probabilities. Each agent maximizes its expected payoff against the worst-case transitions within an uncertainty set. Unlike in classical MFGs, model uncertainty renders the population distribution flow stochastic. This leads us to consider strategies that depend on both individual states and the realized distribution of the population. Our main results establish the asymptotic relationship between N-agent games and MFGs: every MFG equilibrium constitutes an varepsilon-Nash equilibrium for sufficiently large populations, and conversely, limits of N-agent equilibria are MFG equilibria. We also prove the existence of equilibria for finite-agent games and construct a solvable mean-field example with closed-form solutions.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Jan 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 3.
3 papers.