Search Results - "Sering, Leon"
-
1
Dynamic flows with adaptive route choice
Published in Mathematical programming (01-09-2020)“…We study dynamic network flows and introduce a notion of instantaneous dynamic equilibrium ( IDE ) requiring that for any positive inflow into an edge, this…”
Get full text
Journal Article -
2
ReLU neural networks of polynomial size for exact maximum flow computation
Published in Mathematical programming (25-05-2024)Get full text
Journal Article -
3
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
Published in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (06-11-2023)“…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…”
Get full text
Conference Proceeding -
4
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time
Published in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (01-02-2022)“…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…”
Get full text
Conference Proceeding -
5
Drawing Road Networks with Focus Regions
Published in IEEE transactions on visualization and computer graphics (01-12-2011)“…Mobile users of maps typically need detailed information about their surroundings plus some context information about remote places. In order to avoid that the…”
Get full text
Journal Article -
6
Nash Flows Over Time
Published 01-01-2020“…Right now humanity is facing the biggest crisis since the end of the cold war. Every year we produce over 35 gigatons of carbon dioxide (CO2) and more than 15…”
Get full text
Dissertation -
7
ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
Published 17-07-2024“…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…”
Get full text
Journal Article -
8
Multi-Commodity Nash Flows Over Time
Published 05-10-2020“…Motivated by the dynamic traffic assignment problem, we consider flows over time model with deterministic queuing. Dynamic equilibria, called Nash flows over…”
Get full text
Journal Article -
9
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time
Published 07-02-2024“…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…”
Get full text
Journal Article -
10
Atomic Splittable Flow Over Time Games
Published 05-10-2020“…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,…”
Get full text
Journal Article -
11
The Impact of Spillback on the Price of Anarchy for Flows Over Time
Published 08-07-2020“…Flows over time enable a mathematical modeling of traffic that changes as time progresses. In order to evaluate these dynamic flows from a game theoretical…”
Get full text
Journal Article -
12
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time
Published 07-05-2024“…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…”
Get full text
Journal Article -
13
Dynamic Equilibria in Time-Varying Networks
Published 03-07-2020“…Predicting selfish behavior in public environments by considering Nash equilibria is a central concept of game theory. For the dynamic traffic assignment…”
Get full text
Journal Article -
14
Multi-Source Multi-Sink Nash Flows Over Time
Published 03-07-2018“…Nash flows over time describe the behavior of selfish users eager to reach their destination as early as possible while traveling along the arcs of a network…”
Get full text
Journal Article -
15
Convergence of a Packet Routing Model to Flows Over Time
Published 08-12-2022“…The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over…”
Get full text
Journal Article -
16
Dynamic Flows with Adaptive Route Choice
Published 14-03-2020“…Math. Program. 183 (2020) 309-335 We study dynamic network flows and introduce a notion of instantaneous dynamic equilibrium (IDE) requiring that for any…”
Get full text
Journal Article -
17
Nash Flows over Time with Spillback and Kinematic Waves
Published 16-07-2018“…Modeling traffic in road networks is a widely studied but challenging problem, especially under the assumption that drivers act selfishly. A common approach is…”
Get full text
Journal Article -
18
Rainbow cycles in flip graphs
Published 20-12-2017“…The flip graph of triangulations has as vertices all triangulations of a convex $n$-gon, and an edge between any two triangulations that differ in exactly one…”
Get full text
Journal Article