Two Numerical Approaches to Stationary Mean-Field Games

Research output: Contribution to journalArticlepeer-review

38 Scopus citations

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 languageEnglish (US)
Pages (from-to)657-682
Number of pages26
JournalDynamic Games and Applications
Volume7
Issue number4
DOIs
StatePublished - Oct 4 2016

Bibliographical note

KAUST Repository Item: Exported on 2021-02-23
Acknowledgements: 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.

Fingerprint

Dive into the research topics of 'Two Numerical Approaches to Stationary Mean-Field Games'. Together they form a unique fingerprint.

Cite this