# The planning problem in Mean Field Games as regularized mass transport

arXiv: https://arxiv.org/abs/1811.02706 · HTML: https://mlsanity.com/paper/1811.02706/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Nov 2018.

## Built on by (most cited first, 1 of 1)

- [Deep Learning for Mean Field Optimal Transport](https://mlsanity.com/paper/2302.14739/) (2023)

## Abstract (arXiv)

In this paper, using variational approaches, we investigate the first order planning problem arising in the theory of mean field games. We show the existence and uniqueness of weak solutions of the problem in the case of a large class of Hamiltonians with arbitrary superlinear order of growth at infinity and local coupling functions. We require the initial and final measures to be merely summable. At the same time (relying on the techniques developed recently by Graber and M'esz'aros), under stronger monotonicity and convexity conditions on the data, we obtain Sobolev estimates on the solutions of the planning problem both for space and time derivatives.