Displacement Convexity for First-Order Mean-Field Games

Authors

  • Diogo A. Gomes,Tommaso Seneci Author

Keywords:

Mean field game, congestion, optimal transport, displacement convexity. 2010 Mathematics Subject Classification: 91A13, 35Q91, 26B25

Abstract

Here, we consider the planning problem for first-order mean-field games (MFG). When there is no coupling between players, MFG degenerate into optimal transport problems. Displacement convexity is a fundamental tool in optimal transport that often reveals hidden convexity of functionals and, thus, has numerous applications in the calculus of variations. We explore the similarities between the Benamou-Brenier formulation of optimal transport and MFG to extend displacement convexity methods to MFG. In particular, we identify a class of functions, that depend on solutions of MFG, that are convex in time and, thus, obtain new a priori bounds for
 solutions of MFG. A remarkable consequence is the log-convexity of q norms. This convexity gives bounds for the density of solutions of the planning problem and extends displacement convexity of q norms from optimal transport. Additionally, we prove the convexity of q norms for MFG with congestion.

Downloads

Download data is not yet available.

Downloads

Published

2018-07-05

How to Cite

Displacement Convexity for First-Order Mean-Field Games. (2018). Minimax Theory and Its Applications, 3(2), 261–284. http://journalmta.com/index.php/jmta/article/view/47