On the price of anarchy for flows over time

J Correa, A Cristi, T Oosterwijk - … of the 2019 ACM Conference on …, 2019 - dl.acm.org
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 …

Long-term behavior of dynamic equilibria in fluid queuing networks

R Cominetti, J Correa, N Olver - Operations Research, 2022 - pubsonline.informs.org
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 …

Convergence of approximate and packet routing equilibria to Nash flows over time

N Olver, L Sering, LV Koch - 2023 IEEE 64th Annual …, 2023 - ieeexplore.ieee.org
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 …

Dynamic atomic congestion games with seasonal flows

M Scarsini, M Schröder, T Tomala - Operations Research, 2018 - pubsonline.informs.org
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 …

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 …

Continuity, uniqueness and long-term behavior of Nash flows over time

N Olver, L Sering, LV Koch - 2021 IEEE 62nd Annual …, 2022 - ieeexplore.ieee.org
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 …

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 …

Prediction equilibrium for dynamic network flows

L Graf, T Harks, K Kollias, M Markl - Journal of Machine Learning Research, 2023 - jmlr.org
We study a dynamic traffic assignment model, where agents base their instantaneous
routing decisions on real-time delay predictions. We formulate a mathematically concise …

Machine-learned prediction equilibrium for dynamic traffic assignment

L Graf, T Harks, K Kollias, M Markl - … of the AAAI Conference on Artificial …, 2022 - ojs.aaai.org
We study a dynamic traffic assignment model, where agents base their instantaneous
routing decisions on real-time delay predictions. We formulate a mathematically concise …

The price of anarchy for instantaneous dynamic equilibria

L Graf, T Harks - Mathematics of Operations Research, 2023 - pubsonline.informs.org
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 …