Skip to main content

Probabilistic analysis of mean-field games

Author(s): Carmona, Rene; Delarue, F

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr14c6r
Abstract: The purpose of this paper is to provide a complete probabilistic analysis of a large class of stochastic differential games with mean field interactions. We implement the Mean-Field Game strategy developed analytically by Lasry and Lions in a purely probabilistic framework, relying on tailor-made forms of the stochastic maximum principle. While we assume that the state dynamics are affine in the states and the controls, and the costs are convex, our assumptions on the nature of the dependence of all the coefficients upon the statistical distribution of the states of the individual players remains of a rather general nature. Our probabilistic approach calls for the solution of systems of forward-backward stochastic differential equations of a McKean-Vlasov type for which no existence result is known, and for which we prove existence and regularity of the corresponding value function. Finally, we prove that a solution of the Mean-Field Game problem as formulated by Lasry and Lions, does indeed provide approximate Nash equilibriums for games with a large number of players, and we quantify the nature of the approximation. © 2013 Society for Industrial and Applied Mathematics.
Publication Date: 6-Dec-2013
Citation: Carmona, R, Delarue, F. (2013). Probabilistic analysis of mean-field games. SIAM Journal on Control and Optimization, 51 (4), 2705 - 2734. doi:10.1137/120883499
DOI: doi:10.1137/120883499
ISSN: 0363-0129
Pages: 2705 - 2734
Type of Material: Journal Article
Journal/Proceeding Title: SIAM Journal on Control and Optimization
Version: Author's manuscript



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.