The current method for stationary mean-field games on networks
Type
Conference Paper
KAUST Department
Applied Mathematics and Computational Science ProgramComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Date
2019Permanent link to this record
http://hdl.handle.net/10754/662164Metadata
Show full item recordAbstract
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.9029982Conference/Event name
2019 IEEE 58th Conference on Decision and Control (CDC)Additional Links
https://ieeexplore.ieee.org/document/9029982/https://ieeexplore.ieee.org/document/9029982/
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9029982