The current method for stationary mean-field games on networks

Diogo A. Gomes, Diego Marcon, Fatimah Al Saleh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


We discuss first-order stationary mean-field games (MFG) on networks. These models arise in traffic and pedestrian flows. First, we address the mathematical formulation of first-order MFG on networks, including junction conditions for the Hamilton-Jacobi (HJ) equation and transmission conditions for the transport equation. Then, using the current method, we convert the MFG into a system of algebraic equations and inequalities. For critical congestion models, we show how to solve this system by linear programming.
Original languageEnglish (US)
Title of host publication2019 IEEE 58th Conference on Decision and Control (CDC)
Number of pages6
ISBN (Print)9781728113982
StatePublished - 2019

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01


Dive into the research topics of 'The current method for stationary mean-field games on networks'. Together they form a unique fingerprint.

Cite this