TY - GEN
T1 - The current method for stationary mean-field games on networks
AU - Gomes, Diogo A.
AU - Marcon, Diego
AU - Saleh, Fatimah Al
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/662164
UR - https://ieeexplore.ieee.org/document/9029982/
UR - http://www.scopus.com/inward/record.url?scp=85082502626&partnerID=8YFLogxK
U2 - 10.1109/CDC40024.2019.9029982
DO - 10.1109/CDC40024.2019.9029982
M3 - Conference contribution
SN - 9781728113982
SP - 305
EP - 310
BT - 2019 IEEE 58th Conference on Decision and Control (CDC)
PB - IEEE
ER -