Dynamic equilibria in time-varying networks
From MaRDI portal
Publication:2109955
DOI10.1007/978-3-030-57980-7_9zbMATH Open1506.91027arXiv2007.01525OpenAlexW3089745273MaRDI QIDQ2109955FDOQ2109955
Authors: Hoang Minh Pham, Leon Sering 
Publication date: 21 December 2022
Abstract: Predicting selfish behavior in public environments by considering Nash equilibria is a central concept of game theory. For the dynamic traffic assignment problem modeled by a flow over time game, in which every particle tries to reach its destination as fast as possible, the dynamic equilibria are called Nash flows over time. So far, this model has only been considered for networks in which each arc is equipped with a constant capacity, limiting the outflow rate, and with a transit time, determining the time it takes for a particle to traverse the arc. However, real-world traffic networks can be affected by temporal changes, for example, caused by construction works or special speed zones during some time period. To model these traffic scenarios appropriately, we extend the flow over time model by time-dependent capacities and time-dependent transit times. Our first main result is the characterization of the structure of Nash flows over time. Similar to the static-network model, the strategies of the particles in dynamic equilibria can be characterized by specific static flows, called thin flows with resetting. The second main result is the existence of Nash flows over time, which we show in a constructive manner by extending a flow over time step by step by these thin flows.
Full work available at URL: https://arxiv.org/abs/2007.01525
Recommendations
- Fixed-Time Nash Equilibrium Seeking in Time-Varying Networks
- Dynamic Cesaro-Wardrop equilibration in networks
- Dynamic flows in time-varying networks.
- Equilibria in Networks
- The synchronized dynamics of time-varying networks
- Time-varying network models
- Dynamic networks and evolutionary variational inequalities
- Multiple Equilibrium Behaviors on Networks
- A game theoretic approach to the analysis of dynamic networks
- scientific article; zbMATH DE number 1488065
dynamic traffic assignmentdynamic equilibriatime-varying networksdeterministic queuingNash flows over time
Cited In (6)
- Equilibrium characterization and shock propagation in conflict networks
- Nash equilibria and the price of anarchy for flows over time
- Multiple Equilibrium Behaviors on Networks
- Title not available (Why is that?)
- Nash equilibria and the price of anarchy for flows over time
- Computation of Dynamic Equilibria in Series-Parallel Networks
This page was built for publication: Dynamic equilibria in time-varying networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109955)
