Finite horizon mean field games on networks
From MaRDI portal
Publication:2204075
Abstract: We consider finite horizon stochastic mean field games in which the state space is a network. They are described by a system coupling a backward in time Hamilton-Jacobi-Bellman equation and a forward in time Fokker-Planck equation. The value function u is continuous and satisfies general Kirchhoff conditions at the vertices. The density m of the distribution of states satisfies dual transmission conditions: in particular, m is generally discontinuous across the vertices, and the values of m on each side of the vertices satisfy special compatibility conditions. The stress is put on the case when the Hamiltonian is Lipschitz continuous. Existence and uniqueness are proven.
Recommendations
Cites work
- A class of infinite horizon mean field games on networks
- A Hamilton-Jacobi approach to junction problems and application to traffic flows
- Classical solvability of linear parabolic equations on networks
- Diffusion processes on graphs and the averaging principle
- Diffusion processes on graphs: Stochastic differential equations, large deviation principle
- Effective junction conditions for degenerate parabolic equations
- Existence results for some quasilinear parabolic equations
- Flux-limited solutions for quasi-convex Hamilton-Jacobi equations on networks
- Hamilton-Jacobi equations constrained on networks
- Hamilton-Jacobi equations for optimal control on junctions and networks
- scientific article; zbMATH DE number 1061253 (Why is no real title available?)
- scientific article; zbMATH DE number 1487073 (Why is no real title available?)
- scientific article; zbMATH DE number 5681750 (Why is no real title available?)
- scientific article; zbMATH DE number 3262637 (Why is no real title available?)
- scientific article; zbMATH DE number 3264298 (Why is no real title available?)
- scientific article; zbMATH DE number 3302617 (Why is no real title available?)
- Mean field games
- Mean field games. I: The stationary case
- Mean field games. II: Finite horizon and optimal control
- On the weak theory for mean field games systems
- Stationary mean field games systems defined on networks
- Viscosity solutions for junctions: well posedness and stability
- Weak solutions to Fokker-Planck equations and mean field games
- Well-posedness for multi-dimensional junction problems with Kirchoff-type conditions
Cited in
(16)- A class of infinite horizon mean field games on networks
- A model problem for mean field games on networks
- Stationary mean field games systems defined on networks
- Representation of finite games as network congestion games
- Regular Networks Unification in Games with Stochastic Parameters
- Mean field games under invariance conditions for the state space
- A time-dependent switching mean-field game on networks motivated by optimal visiting problems
- A continuous dependence estimate for viscous Hamilton-Jacobi equations on networks with applications
- Reinforcement learning for non-stationary discrete-time linear-quadratic mean-field games in multiple populations
- Infinite horizon LQG graphon mean field games: explicit Nash values and local minima
- First-order mean-field games on networks and Wardrop equilibrium
- Deterministic mean field games on networks: a Lagrangian approach
- Sticky diffusions on star graphs: characterization and Itô formula
- Stationary mean field games on networks with sticky transition conditions
- A network model for urban planning
- Mean field systems on networks, with singular interaction through hitting times
This page was built for publication: Finite horizon mean field games on networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2204075)
