Displacement Convexity for First-Order Mean-Field Games
In this thesis, we consider the planning problem for first-order mean-field games (MFG). These games degenerate into optimal transport when there is no coupling between players. Our aim is to extend the concept of displacement convexity from optimal transport to MFGs. This extension gives new estima...
Main Author: | Seneci, Tommaso |
---|---|
Other Authors: | Gomes, Diogo A. |
Language: | en |
Published: |
2018
|
Subjects: | |
Online Access: | Seneci, T. (2018). Displacement Convexity for First-Order Mean-Field Games. KAUST Research Repository. https://doi.org/10.25781/KAUST-1OC2F http://hdl.handle.net/10754/627746 |
Similar Items
-
Explicit Solutions for One-Dimensional Mean-Field Games
by: Prazeres, Mariana
Published: (2017) -
OMPLEMENTARY OF CLASSICAL MEANS WITH RESPECT TO HERON MEAN AND THEIR SCHUR CONVEXITIES
by: K M Nagaraja, et al.
Published: (2021-06-01) -
Information, complexity and structure in convex optimization
by: Guzman Paredes, Cristobal
Published: (2015) -
Mean Field Games for Jump Non-Linear Markov Process
by: Basna, Rani
Published: (2016) -
Accelerating convex optimization in machine learning by leveraging functional growth conditions
by: Xu, Yi
Published: (2019)