Publications

Spillback changes the long-term behavior of dynamic equilibria in fluid queuing networks
We study the long-term behavior of dynamic traffic equilibria and find that it heavily depends on whether spillback is captured in the …
Theresa Ziemke, Leon Sering, Kai Nagel
PDF Cite DOI
Spillback changes the long-term behavior of dynamic equilibria in fluid queuing networks
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
This paper studies the expressive power of artificial neural networks with rectified linear units. In order to study them as a model of …
Christoph Hertrich, Leon Sering
PDF Cite DOI arXiv
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
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 …
Neil Olver, Leon Sering, Laura Vargas Koch
PDF Cite DOI arXiv
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
Fair and Fast k-Center Clustering for Data Summarization

We consider two key issues faced by many clustering methods when used for data summarization, namely (a) an unfair representation of …

Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen
PDF Cite URL
Fair and Fast k-Center Clustering for Data Summarization
Convergence of a Packet Routing Model to Flows over Time
The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and …
Leon Sering, Laura Vargas Koch, Theresa Ziemke
PDF Cite DOI arXiv
Convergence of a Packet Routing Model to Flows over Time
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 …

Neil Olver, Leon Sering, Laura Vargas Koch
PDF Cite DOI arXiv
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time
Atomic Splittable Flow Over Time Games
In an atomic splittable flow over time game, finitely many players route flow dynamically through a network, in which edges are …
Antonia Adamik, Leon Sering
PDF Cite DOI arXiv
Atomic Splittable Flow Over Time Games
The Impact of Spillback on the Price of Anarchy for Flows over Time
Flows over time enable a mathematical modeling of traffic that changes as time progresses. In order to evaluate these dynamic flows …
Jonas Israel, Leon Sering
PDF Cite DOI arXiv
The Impact of Spillback on the Price of Anarchy for Flows over Time
Rainbow Cycles in Flip Graphs
The flip graph of triangulations has as vertices all triangulations of a convex n-gon, and an edge between any two triangulations that …
Stefan Felsner, Linda Kleist, Torsten Mütze, Leon Sering
PDF Cite DOI arXiv
Rainbow Cycles in Flip Graphs
Nash Flows Over Time
Motivated by the dynamic traffic assignment problem and with the goal in mind to obtain a better understanding of the complex traffic …
Leon Sering
PDF Cite DOI
Nash Flows Over Time
Flows Over Time as Continuous Limits of Packet-Based Network Simulations
This study examines the connection between an agent-based transport simulation and Nash flows over time. While the former is able to …
Theresa Ziemke, Leon Sering, Laura Vargas Koch, Max Zimmer, Kai Nagel, Martin Skutella
PDF Cite DOI
Flows Over Time as Continuous Limits of Packet-Based Network Simulations
Dynamic Flows with Adaptive Route Choice
We study dynamic network flows and introduce a notion of instantaneous dynamic equilibrium (IDE) requiring that for any positive inflow …
Lukas Graf, Tobias Harks, Leon Sering
PDF Cite DOI arXiv
Dynamic Flows with Adaptive Route Choice
Dynamic Equilibria in Time-Varying Networks
Predicting selfish behavior in public environments by considering Nash equilibria is a central concept of game theory. For the dynamic …
Hoang Minh Pham, Leon Sering
PDF Cite DOI arXiv
Dynamic Equilibria in Time-Varying Networks
Nash Flows Over Time with Spillback
Modeling traffic in road networks is a widely studied but challenging problem, especially under the assumption that drivers act …
Leon Sering, Laura Vargas Koch
PDF Cite DOI arXiv
Nash Flows Over Time with Spillback
Multi-Source Multi-Sink Nash Flows over Time
Nash flows over time describe the behavior of selfish users eager to reach their destination as early as possible while traveling along …
Leon Sering, Martin Skutella
PDF Cite DOI arXiv
Multi-Source Multi-Sink Nash Flows over Time
A Combinatorial Upper Bound on the Length of Twang Cascades
Damian et al. introduced an intuitive type of transformations between simple polygons on a finite set of points in the plane. Each …
Leon Sering
PDF Cite
A Combinatorial Upper Bound on the Length of Twang Cascades
Drawing Road Networks with Focus Regions
Mobile users of maps typically need detailed information about their surroundings plus some context information about remote places. In …
Jan-Henrik Haunert, Leon Sering
PDF Cite DOI
Drawing Road Networks with Focus Regions