Mean-field game theory

From Wikipedia, the free encyclopedia

Mean-field game theory is the study of strategic decision making by small interacting agents in very large populations. Use of the term "mean field" is inspired by mean-field theory in physics, which considers the behaviour of systems of large numbers of particles where individual particles have negligible impact upon the system.

This class of problems was considered in the economics literature by Boyan Jovanovic and Robert W. Rosenthal,[1] in the engineering literature by Minyi Huang, Roland Malhame, and Peter E. Caines[2][3][4] and independently and around the same time by mathematicians  [fr] and Pierre-Louis Lions.[5][6]

In continuous time a mean-field game is typically composed by a Hamilton–Jacobi–Bellman equation that describes the optimal control problem of an individual and a Fokker–Planck equation that describes the dynamics of the aggregate distribution of agents. Under fairly general assumptions it can be proved that a class of mean-field games is the limit as of a N-player Nash equilibrium.[7]

A related concept to that of mean-field games is "mean-field-type control". In this case a social planner controls a distribution of states and chooses a control strategy. The solution to a mean-field-type control problem can typically be expressed as dual adjoint Hamilton–Jacobi–Bellman equation coupled with Kolmogorov equation. Mean-field-type game theory is the multi-agent generalization of the single-agent mean-field-type control.[8]

Linear-quadratic Gaussian game problem[]

From Caines (2009), a relatively simple model of large-scale games is the linear-quadratic Gaussian model. The individual agent's dynamics are modeled as a stochastic differential equation

where is the state of the -th agent, is the control of the -th agent, and are independent Wiener processes for all . The individual agent's cost is

The coupling between agents occurs in the cost function.

See also[]

References[]

  1. ^ Jovanovic, Boyan; Rosenthal, Robert W. (1988). "Anonymous Sequential Games". Journal of Mathematical Economics. 17 (1): 77–87. doi:10.1016/0304-4068(88)90029-8.
  2. ^ Huang, M. Y.; Malhame, R. P.; Caines, P. E. (2006). "Large Population Stochastic Dynamic Games: Closed-Loop McKean–Vlasov Systems and the Nash Certainty Equivalence Principle". Communications in Information and Systems. 6 (3): 221–252. doi:10.4310/CIS.2006.v6.n3.a5. Zbl 1136.91349.
  3. ^ Nourian, M.; Caines, P. E. (2013). "ε–Nash mean field game theory for nonlinear stochastic dynamical systems with major and minor agents". SIAM Journal on Control and Optimization. 51 (4): 3302–3331. arXiv:1209.5684. doi:10.1137/120889496. S2CID 36197045.
  4. ^ Djehiche, Boualem; Tcheukam, Alain; Tembine, Hamidou (2017). "Mean-Field-Type Games in Engineering". AIMS Electronics and Electrical Engineering. 1 (1): 18–73. arXiv:1605.03281. doi:10.3934/ElectrEng.2017.1.18. S2CID 16055840.
  5. ^ Lions, Pierre-Louis; Lasry, Jean-Michel (March 2007). "Large investor trading impacts on volatility". Annales de l'Institut Henri Poincaré C. 24 (2): 311–323. Bibcode:2007AIHPC..24..311L. doi:10.1016/j.anihpc.2005.12.006.
  6. ^ Lasry, Jean-Michel; Lions, Pierre-Louis (28 March 2007). "Mean field games". Japanese Journal of Mathematics. 2 (1): 229–260. doi:10.1007/s11537-007-0657-8. S2CID 1963678.
  7. ^ Cardaliaguet, Pierre (September 27, 2013). "Notes on Mean Field Games" (PDF).
  8. ^ Bensoussan, Alain; Frehse, Jens; Yam, Phillip (2013). Mean Field Games and Mean Field Type Control Theory. Springer Briefs in Mathematics. New York: Springer-Verlag. ISBN 9781461485070.[page needed]

External links[]

Retrieved from ""