On the price of anarchy for flows over time
Dynamic network flows, or network flows over time, constitute an important model for real-
world situations where steady states are unusual, such as urban traffic and the Internet …
world situations where steady states are unusual, such as urban traffic and the Internet …
Long-term behavior of dynamic equilibria in fluid queuing networks
A fluid queuing network constitutes one of the simplest models in which to study flow
dynamics over a network. In this model we have a single source-sink pair, and each link has …
dynamics over a network. In this model we have a single source-sink pair, and each link has …
Convergence of approximate and packet routing equilibria to Nash flows over time
We consider a dynamic model of traffic that has received a lot of attention in the past few
years. Infinitesimally small agents aim to travel from a source to a destination as quickly as …
years. Infinitesimally small agents aim to travel from a source to a destination as quickly as …
Dynamic atomic congestion games with seasonal flows
We propose a model of discrete time dynamic congestion games with atomic players and a
single source-destination pair. The latencies of edges are composed of free-flow transit …
single source-destination pair. The latencies of edges are composed of free-flow transit …
Dynamic traffic equilibria with route and departure time choice
D Frascaria - 2021 - research.vu.nl
This thesis studies the dynamic equilibrium behavior in traffic networks and it is motivated by
rush-hour congestion. It is well understood that one of the key causes of traffic congestion …
rush-hour congestion. It is well understood that one of the key causes of traffic congestion …
Continuity, uniqueness and long-term behavior of Nash flows over time
We consider a dynamic model of traffic that has received a lot of attention in the past few
years. Users control infinitesimal flow particles aiming to travel from a source to destination …
years. Users control infinitesimal flow particles aiming to travel from a source to destination …
Routing games over time with FIFO policy
A Ismaili - Web and Internet Economics: 13th International …, 2017 - Springer
We study atomic routing games where every agent travels both along its decided edges and
through time. The agents arriving on an edge are first lined up in a first-in-first-out queue and …
through time. The agents arriving on an edge are first lined up in a first-in-first-out queue and …
Prediction equilibrium for dynamic network flows
We study a dynamic traffic assignment model, where agents base their instantaneous
routing decisions on real-time delay predictions. We formulate a mathematically concise …
routing decisions on real-time delay predictions. We formulate a mathematically concise …
Machine-learned prediction equilibrium for dynamic traffic assignment
We study a dynamic traffic assignment model, where agents base their instantaneous
routing decisions on real-time delay predictions. We formulate a mathematically concise …
routing decisions on real-time delay predictions. We formulate a mathematically concise …
The price of anarchy for instantaneous dynamic equilibria
We consider flows over time within the deterministic queueing model of Vickrey and study
the solution concept of instantaneous dynamic equilibrium (IDE), in which flow particles …
the solution concept of instantaneous dynamic equilibrium (IDE), in which flow particles …