We study well posedness of time–dependent Hamilton–Jacobi equations on a network,
coupled with a continuous initial datum and a flux limiter. We show existence and …

We explore the relationship between Wardrop equilibrium and stationary mean-field games
(MFG) on networks with flow-dependent costs. First, we present the notion of Wardrop …

We provide a Lax–Oleinik-type representation formula for solutions of time-dependent
Hamilton–Jacobi equations, posed on a network with a rather general geometry, under …

We prove a homogenization result for a family of time-dependent Hamilton-Jacobi
equations, rescaled by a parameter $\varepsilon $ tending to zero, posed on a periodic …

We study discounted Hamilton-Jacobi equations on networks, without putting any restriction
on their geometry. Assuming the Hamiltonians are continuous and coercive, we establish a …

We extend the study of eikonal Hamilton-Jacobi equations posed on networks performed by
Siconolfi and Sorrentino (Anal. PDE, 2018) to a more general setting. Their approach …

Starting from Namah and Roquejoffre (1999) and Fathi (1998), the large time asymptotic
behavior of solutions to Hamilton--Jacobi equations has been extensively investigated by …

Abstract We formulate Aubry–Mather theory for Hamiltonians/Lagrangians defined on
graphs, study the structure of minimizing measures, and discuss the relationship with weak …

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 …

Mean-Field Games on Networks and Wardrop Equilibria Page 1 Mean-Field Games on
Networks and Wardrop Equilibria Dissertation by Fatimah Al Saleh In Partial Fulfillment of the …