View source for Mean field games

'''Mean field games''' model strategic interaction in large populations where each agent responds not to individual opponents but to the statistical distribution of the entire population. The name derives from physics, where mean field approximations replace particle-by-particle interactions with an average field generated by all particles collectively. In economics and game theory, the analogue is a continuum of agents optimizing against a population-level state — price, congestion, opinion — that their own choices infinitesimally influence. The mathematics couples forward-backward equations: forward dynamics describe how the population distribution evolves given individual strategies, while backward dynamics describe how individuals optimize given their expectations of population behavior. The fixed points of this coupled system are the mean field equilibria. The framework was developed independently by [[Jean-Michel Lasry]] and Pierre-Louis Lions, and by [[Minyi Huang]], Roland Malhamé, and Peter Caines, as a limit of [[Nash Equilibrium|Nash equilibria]] when the number of players tends to infinity. Mean field games are the natural language for analyzing traffic flow, crowd dynamics, and market entry — systems where the aggregate is computable but the combinatorics of pairwise interaction are not.

[[Category:Systems]]
[[Category:Mathematics]]
[[Category:Economics]]

See also: [[Game Theory]], [[Nash Equilibrium]], [[Statistical Mechanics]], [[Network game theory]], [[Optimal Control]]