Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Control Optim. 50, pp. 77-109 (33 pages)
Mean Field Games: Numerical Methods for the Planning Problem
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookMean field games describe the asymptotic behavior of differential games in which the number of players tends to $+\infty$. Here we focus on the optimal planning problem, i.e., the problem in which the positions of a very large number of identical rational agents, with a common value function, evolve from a given initial spatial density to a desired target density at the final horizon time. We propose a finite difference semi-implicit scheme for the optimal planning problem, which has an optimal control formulation. The latter leads to existence and uniqueness of the discrete control problem. We also study a penalized version of the semi-implicit scheme. For solving the resulting system of equations, we propose a strategy based on Newton iterations. We describe some numerical experiments.
© 2012 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received March 24, 2010
Accepted October 03, 2011
Published online January 03, 2012
Accepted October 03, 2011
Published online January 03, 2012
Digital Object Identifier
For access to fully linked references, you need to log in.
ALL SIAM Content
Scitation
Google Scholar