The current method for stationary mean-field games on networks

Thumbnail
Name:
09029982.pdf
Size:
367.2Kb
Format:
PDF
Description:
Accepted manuscript
Download
Type
Conference Paper
Authors
Gomes, Diogo A. cc
Marcon, Diego
Saleh, Fatimah Al
KAUST Department
Applied Mathematics and Computational Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Date
2019
Permanent link to this record
http://hdl.handle.net/10754/662164

Metadata
Show full item record
Abstract
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.
Citation
Gomes, D. A., Marcon, D., & Saleh, F. A. (2019). The current method for stationary mean-field games on networks. 2019 IEEE 58th Conference on Decision and Control (CDC). doi:10.1109/cdc40024.2019.9029982
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Conference/Event name
2019 IEEE 58th Conference on Decision and Control (CDC)
DOI
10.1109/CDC40024.2019.9029982
Additional Links
https://ieeexplore.ieee.org/document/9029982/
https://ieeexplore.ieee.org/document/9029982/
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9029982
Collections
Conference Papers; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division