A potential approach for planning mean-field games in one dimension
From MaRDI portal
Publication:2135228
Abstract: This manuscript discusses planning problems for first- and second-order one-dimensional mean-field games (MFGs). These games are comprised of a Hamilton-Jacobi equation coupled with a Fokker-Planck equation. Applying Poincar'e'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 one-dimensional Hughes' model.
Recommendations
Cites work
- A new class of transport distances between measures
- A variational approach to the mean field planning problem
- An Introduction to Variational Inequalities and Their Applications
- Displacement convexity for first-order mean-field games
- Existence of weak solutions to first-order stationary mean-field games with Dirichlet conditions
- Existence of weak solutions to stationary mean-field games through variational inequalities
- Existence of weak solutions to time-dependent mean-field games
- Finite difference methods for mean field games
- First-order, stationary mean-field games with congestion
- Geodesics for a class of distances in the space of probability measures
- Hopf-Type Estimates and Formulas For Nonconvex Nonconcave Hamilton--Jacobi Equations
- scientific article; zbMATH DE number 1181255 (Why is no real title available?)
- Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle
- Mean field games
- Mean field games. I: The stationary case
- Mean field games. II: Finite horizon and optimal control
- Mean field games: numerical methods for the planning problem
- Modern methods in the calculus of variations. L^p spaces
- On the planning problem for the mean field games system
- On the variational formulation of some stationary second-order mean field games systems
- Optimal transport of closed differential forms for convex costs
- Some estimates for the planning problem with potential
- The planning problem in mean field games as regularized mass transport
- The pullback equation for differential forms
- The three-dimensional Navier-Stokes equations. Classical theory
- Transportation of closed differential forms with non-homogeneous convex costs
- Weak solutions to Fokker-Planck equations and mean field games
Cited in
(8)- Particle approximation of one-dimensional mean-field games with local interactions
- A variational approach to the mean field planning problem
- The planning problem in mean field games as regularized mass transport
- Discrete approximation of stationary mean field games
- A variational approach for price formation models in one dimension
- An introduction to monotonicity methods in mean-field games
- Ranking mean-field planning games
- Some estimates for the planning problem with potential
This page was built for publication: A potential approach for planning mean-field games in one dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2135228)