1 citations · 2 across the 6 of their papers we have counts for
11 papers
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
Neil Olver, Leon Sering, Laura Vargas Koch
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 quic…
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time
Neil Olver, Leon Sering, Laura Vargas Koch
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 an origin to a d…
Convergence of a Packet Routing Model to Flows Over Time
Leon Sering, Laura Vargas Koch, Theresa Ziemke
The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite ve…
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
Christoph Hertrich, Leon Sering
This paper studies the expressive power of artificial neural networks with rectified linear units. In order to study them as a model of real-valued computation, we introduce the co…
Multi-Commodity Nash Flows Over Time
Leon Sering
Motivated by the dynamic traffic assignment problem, we consider flows over time model with deterministic queuing. Dynamic equilibria, called Nash flows over time, have been studie…
Atomic Splittable Flow Over Time Games
Antonia Adamik, Leon Sering
In an atomic splittable flow over time game, finitely many players route flow dynamically through a network, in which edges are equipped with transit times, specifying the traversi…