19 citations · 47 across the 9 of their papers we have counts for
11 papers
Tolls for Dynamic Equilibrium Flows
Lukas Graf, Tobias Harks, Julian Schwarz
We consider dynamic network flows and study the following question: Which dynamic edge flows can be implemented as tolled dynamic equilibrium flows? We study this question for the…
Are System Optimal Dynamic Flows Implementable by Tolls?
Lukas Graf, Tobias Harks, Julian Schwarz
A seminal result of [Fleischer et al. and Karakostas and Kolliopulos, both FOCS 2004] states that system optimal multi-commodity static network flows are always implementable as to…
Stochastic Prediction Equilibrium for Dynamic Traffic Assignment
Lukas Graf, Tobias Harks, Michael Markl
Stochastic effects significantly influence the dynamics of traffic flows. Many dynamic traffic assignment (DTA) models attempt to capture these effects by prescribing a specific ra…
A Decomposition Theorem for Dynamic Flows
Lukas Graf, Tobias Harks, Julian Schwarz
The famous flow decomposition theorem of Gallai (1985) states that any static edge ,-flow in a directed graph can be decomposed into a nonnegative linear combination of incid…
DoBe -- A Python Tool for Neutrinoless Double Beta Decay
Oliver Scholer, Jordy de Vries, Lukáš Gráf
We present DoBe, a Python tool for the computation of neutrinoless double beta decay () rates in terms of lepton-number-violating operators in the Standard Model Effective…
Side-Constrained Dynamic Traffic Equilibria
Lukas Graf, Tobias Harks
We study dynamic traffic assignment with side-constraints. We first give a counter-example to a key result from the literature regarding the existence of dynamic equilibria for vol…
Dynamic Traffic Assignment for Electric Vehicles
Lukas Graf, Tobias Harks, Prashant Palkar
We initiate the study of dynamic traffic assignment for electrical vehicles addressing the specific challenges such as range limitations and the possibility of battery recharge at…
Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment
Lukas Graf, Tobias Harks, Kostas Kollias +1
We study a dynamic traffic assignment model, where agents base their instantaneous routing decisions on real-time delay predictions. We formulate a mathematically concise model and…
A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows
Lukas Graf, Tobias Harks
Instantaneous dynamic equilibrium (IDE) is a standard game-theoretic concept in dynamic traffic assignment in which individual flow particles myopically select en route currently s…
The Price of Anarchy for Instantaneous Dynamic Equilibria
Lukas Graf, Tobias Harks
We consider flows over time within the deterministic queueing model and study the solution concept of instantaneous dynamic equilibrium (IDE) in which flow particles select at ever…
Dynamic Flows with Adaptive Route Choice
Lukas Graf, Tobias Harks, Leon Sering
We study dynamic network flows and introduce a notion of instantaneous dynamic equilibrium (IDE) requiring that for any positive inflow into an edge, this edge must lie on a curren…