TL;DR
This paper introduces a machine learning framework that efficiently solves high-dimensional mean field game and control problems by combining Lagrangian and Eulerian approaches with neural networks, overcoming the curse of dimensionality.
Contribution
The paper presents a novel neural network-based method that avoids spatial discretization for high-dimensional MFG and MFC problems, enabling solutions in 100 dimensions.
Findings
Successfully solved 100-dimensional problems on standard hardware.
Validated results with a 2D Eulerian solver.
Demonstrated applicability to optimal transport and crowd motion.
Abstract
Mean field games (MFG) and mean field control (MFC) are critical classes of multi-agent models for efficient analysis of massive populations of interacting agents. Their areas of application span topics in economics, finance, game theory, industrial engineering, crowd motion, and more. In this paper, we provide a flexible machine learning framework for the numerical solution of potential MFG and MFC models. State-of-the-art numerical methods for solving such problems utilize spatial discretization that leads to a curse-of-dimensionality. We approximately solve high-dimensional problems by combining Lagrangian and Eulerian viewpoints and leveraging recent advances from machine learning. More precisely, we work with a Lagrangian formulation of the problem and enforce the underlying Hamilton-Jacobi-Bellman (HJB) equation that is derived from the Eulerian formulation. Finally, a tailored…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
