First-order mean-field games on networks and Wardrop equilibrium

DOI10.4171/PM/2124MaRDI QIDQ6619403zbMATH OpenFDO

Authors Fatimah Al Saleh, Tigran K. Bakaryan, D. Gomes, Ricardo de Lima Ribeiro

Publication date 15 October 2024

Published in Portugaliae Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4171/PM/2124

zbMATH Keywords

calibrationflow-dependent costsmean-field games (MFG)networksnon-monotonic MFGsroad trafficWardrop equilibrium

Mathematics Subject Classification ID

Mean field games and control (49N80) Traffic and pedestrian flow models (76A30) Mean field games (aspects of game theory) (91A16) Games involving graphs (91A43)

Recommendations

• First-order, stationary mean-field games with congestion
• Deterministic mean field games on networks: a Lagrangian approach
• Origin-to-destination network flow with path preferences and velocity controls: a mean field game-like approach
• On the relationship between Nash—Cournot and Wardrop equilibria
• Connections between mean-field game and social welfare optimization

Cites work

• A class of infinite horizon mean field games on networks
• A comparison among various notions of viscosity solution for Hamilton-Jacobi equations on networks
• A continuous theory of traffic congestion and Wardrop equilibria
• A Hamilton-Jacobi approach to junction problems and application to traffic flows
• A Mean-Field Game of Evacuation in Multilevel Building
• A model problem for mean field games on networks
• A numerical method for mean field games on networks
• A time-dependent switching mean-field game on networks motivated by optimal visiting problems
• About an optimal visiting problem
• Continuous limit of a crowd motion and herding model: analysis and numerical simulations
• Deterministic mean field games with control on the acceleration
• Deterministic mean field games with control on the acceleration and state constraints
• Finite horizon mean field games on networks
• Global results for eikonal Hamilton-Jacobi equations on networks
• Hamilton-Jacobi equations constrained on networks
• Mean field games with nonlinear mobilities in pedestrian dynamics
• Mean field games. I: The stationary case
• Models for vehicular traffic on networks
• On the modeling of traffic and crowds: a survey of models, speculations, and perspectives
• On the planning problem for the mean field games system
• One-dimensional stationary mean-field games with local coupling
• Optimal control of the mean field equilibrium for a pedestrian tourists' flow model
• Optimal Transportation with Traffic Congestion and Wardrop Equilibria
• Origin-to-destination network flow with path preferences and velocity controls: a mean field game-like approach
• Stationary mean field games systems defined on networks
• The Lax-Oleinik semigroup on graphs
• The vanishing viscosity limit for Hamilton-Jacobi equations on networks
• Transport of measures on networks
• Viscosity solutions for junctions: well posedness and stability
• Viscosity solutions of eikonal equations on topological networks
• Well-posedness for multi-dimensional junction problems with Kirchoff-type conditions

Cited in

(1)

• Deterministic mean field games on networks: a Lagrangian approach

This page was built for publication: First-order mean-field games on networks and Wardrop equilibrium

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619403)