Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the connection between symmetric $N$-player games and mean field games (1405.1345v2)

Published 6 May 2014 in math.PR

Abstract: Mean field games are limit models for symmetric $N$-player games with interaction of mean field type as $N\to\infty$. The limit relation is often understood in the sense that a solution of a mean field game allows to construct approximate Nash equilibria for the corresponding $N$-player games. The opposite direction is of interest, too: When do sequences of Nash equilibria converge to solutions of an associated mean field game? In this direction, rigorous results are mostly available for stationary problems with ergodic costs. Here, we identify limit points of sequences of certain approximate Nash equilibria as solutions to mean field games for problems with It{^o}-type dynamics and costs over a finite time horizon. Limits are studied through weak convergence of associated normalized occupation measures and identified using a probabilistic notion of solution for mean field games.

Summary

We haven't generated a summary for this paper yet.