A potential approach for planning mean-field games in one dimension

Abstract. This manuscript discusses planning problems for firstand second-order onedimensional mean-field games (MFGs). These games are comprised of a Hamilton–Jacobi equation coupled with a Fokker–Planck equation. Applying Poincaré’s Lemma to the Fokker–Planck equation, we deduce the existence of a potential. Rewriting the Hamilton– Jacobi equation in terms of the potential, we obtain a system of Euler–Lagrange equations for certain variational problems. Instead of the mean-field planning problem (MFP), we study this variational problem. By the direct method in the calculus of variations, we prove the existence and uniqueness of solutions to the variational problem. The variational approach has the advantage of eliminating the continuity equation. We also consider a first-order MFP with congestion. We prove that the congestion problem has a weak solution by introducing a potential and relying on the theory of variational inequalities. We end the paper by presenting an application to the onedimensional Hughes’ model.

[1]  D. Kinderlehrer,et al.  An introduction to variational inequalities and their applications , 1980 .

[2]  Diogo Gomes,et al.  Some estimates for the planning problem with potential , 2021, Nonlinear Differential Equations and Applications NoDEA.

[3]  Diogo Gomes,et al.  Existence of weak solutions to time-dependent mean-field games. , 2020, 2001.03928.

[4]  Diogo Gomes,et al.  Existence of weak solutions to first-order stationary mean-field games with Dirichlet conditions , 2018, Proceedings of the American Mathematical Society.

[5]  James C. Robinson,et al.  The Three-Dimensional Navier-Stokes Equations: Classical Theory , 2016 .

[6]  I. Fonseca,et al.  Modern Methods in the Calculus of Variations: L^p Spaces , 2007 .

[7]  Diogo Gomes,et al.  Existence of Weak Solutions to Stationary Mean-Field Games through Variational Inequalities , 2015, SIAM J. Math. Anal..

[8]  Yves Achdou,et al.  Mean Field Games: Numerical Methods for the Planning Problem , 2012, SIAM J. Control. Optim..

[9]  P. Lions,et al.  Jeux à champ moyen. I – Le cas stationnaire , 2006 .

[10]  G. M.,et al.  Partial Differential Equations I , 2023, Applied Mathematical Sciences.

[11]  Optimal transport of closed differential forms for convex costs , 2015 .

[12]  Pierre Maréchal,et al.  The role of perspective functions in convexity, polyconvexity, rank-one convexity and separate convexity , 2008 .

[13]  P. Lions,et al.  Jeux à champ moyen. II – Horizon fini et contrôle optimal , 2006 .

[14]  Giuseppe Savaré,et al.  A variational approach to the mean field planning problem , 2018, Journal of Functional Analysis.

[15]  Alessio Porretta,et al.  On the Planning Problem for the Mean Field Games System , 2014, Dyn. Games Appl..

[16]  P. Lions,et al.  Mean field games , 2007 .

[17]  Jules Michelet,et al.  Cours au Collège de France , 1995 .

[18]  Gyula Csató,et al.  The Pullback Equation for Differential Forms , 2011 .

[19]  Alessio Porretta,et al.  Weak Solutions to Fokker–Planck Equations and Mean Field Games , 2015 .

[20]  W. Gangbo,et al.  Transportation of closed differential forms with non-homogeneous convex costs , 2018, Calculus of Variations and Partial Differential Equations.

[21]  Francisco J. Silva,et al.  The planning problem in mean field games as regularized mass transport , 2018, Calculus of Variations and Partial Differential Equations.

[22]  Peter E. Caines,et al.  Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle , 2006, Commun. Inf. Syst..

[23]  Yves Achdou,et al.  Finite Difference Methods for Mean Field Games , 2013 .

[24]  D. Gomes,et al.  Displacement Convexity for First-Order Mean-Field Games , 2018, 1807.07090.