Origin-to-destination network flow with path preferences and velocity controls: a mean field game-like approach

DOI10.3934/JDG.2021007MaRDI QIDQ2068792zbMATH OpenOpenAlexFDO

Authors Fabio Bagagiolo, Rosario Maggistro, Raffaele Pesenti

Publication date 20 January 2022

Published in Journal of Dynamics and Games (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.09506

zbMATH Keywords

dynamical flow networksexistence of equilibriummean field gamespath preferences dynamicstraffic flow optimal control

Mathematics Subject Classification ID

Existence theories for optimal control problems involving ordinary differential equations (49J15) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Mean field games (aspects of game theory) (91A16)

Abstract: In this paper we consider a mean field approach to modeling the agents flow over a transportation network. In particular, beside a standard framework of mean field games, with controlled dynamics by the agents and costs mass-distribution dependent, we also consider a path preferences dynamics obtained as a generalization of the so-called noisy best response dynamics. Such a preferences dynamics says the agents choose their path having access to global information about the network congestion state and based on the observation of the decision of the agents that have preceded. We prove the existence of a mean field equilibrium obtained as a fixed point of a map over a suitable set of time-varying mass-distributions, defined edge by edge in the network. We also address the case where the admissible set of controls is suitably bounded depending on the mass-distribution on the edge itself.

Recommendations

• A model problem for mean field games on networks
• Sustainable management of tourist flow networks: a mean field model
• Minimal-time mean field games
• A numerical method for mean field games on networks
• A time-dependent switching mean-field game on networks motivated by optimal visiting problems

Cites work

• A class of games possessing pure-strategy Nash equilibria
• A model problem for mean field games on networks
• Computation of mean field equilibria in economics
• Discontinuous solutions of deterministic optimal stopping time problems
• Game theoretic decentralized feedback controls in Markov jump processes
• scientific article; zbMATH DE number 1414249 (Why is no real title available?)
• Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle
• Mean field games and applications
• Mean field games. II: Finite horizon and optimal control
• Mean field games: numerical methods for the planning problem
• Measure-theoretic models for crowd dynamics
• Modeling rationality to control self-organization of crowds: an environmental approach
• Multiscale modeling of granular flows with application to crowd dynamics
• Multiscale modeling of pedestrian dynamics
• Non-memoryless pedestrian flow in a crowded environment with target sets
• ON THE MODELLING CROWD DYNAMICS FROM SCALING TO HYPERBOLIC MACROSCOPIC MODELS
• Pedestrian flows and non-classical shocks
• Pedestrian travel behavior modeling
• Stability Analysis of Transportation Networks with Multiscale Driver Decisions
• Time-evolving measures and macroscopic modeling of pedestrian flow
• Transport equation with nonlocal velocity in Wasserstein spaces: convergence of numerical schemes
• Transport of measures on networks

Cited in

(3)

• Sustainable management of tourist flow networks: a mean field model
• A time-dependent switching mean-field game on networks motivated by optimal visiting problems
• First-order mean-field games on networks and Wardrop equilibrium

This page was built for publication: Origin-to-destination network flow with path preferences and velocity controls: a mean field game-like approach

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