Abstract
Here, we consider numerical methods for stationary mean-field games (MFG) and investigate two classes of algorithms. The first one is a gradient-flow method based on the variational characterization of certain MFG. The second one uses monotonicity properties of MFG. We illustrate our methods with various examples, including one-dimensional periodic MFG, congestion problems, and higher-dimensional models.
Original language | English (US) |
---|---|
Pages (from-to) | 657-682 |
Number of pages | 26 |
Journal | Dynamic Games and Applications |
Volume | 7 |
Issue number | 4 |
DOIs | |
State | Published - Oct 4 2016 |
Bibliographical note
KAUST Repository Item: Exported on 2021-02-23Acknowledgements: The authors were partially supported by King Abdullah University of Science and Technology baseline and start-up funds and by KAUST SRI, Center for Uncertainty Quantification in Computational Science and Engineering.