Lukas Graf M.Sc.
|Telefon:||+49 (0)821 598-2230|
|Sprechzeiten:||Derzeit überwiegend im Homeoffice - bei Fragen per Mail erreichbar. Telefon/Zoom/Skype-Sprechstunden auf Anfrage.|
|Adresse:||Universitätsstraße 14, 86159 Augsburg|
- Dynamic Traffic Assignment for Electric Vehicles (to appear)
We study dynamic traffic assignment for electrical vehicles addressing the specific challenges such as range limitations and the possibility of battery recharge at predefined charging locations. We pose the dynamic equilibrium problem within the deterministic queueing model of Vickrey and as our main result, we establish the existence of an energy-feasible dynamic equilibrium. We complement our theoretical results by a computational study in which we design a fixed-point algorithm computing energy-feasible dynamic equilibria.
- Preprint on arXiv: https://arxiv.org/abs/2207.04454
- Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment (published)
We study a dynamic traffic assignment model, where agents base their instantaneous routing decisions on real-time delay predictions. We describe a general mathematical model which, in particular, includes the settings leading to IDE und DE. On the theoretical side we show existence of equilibrium solutions under some additional assumptions while on the practical side we implement a machine-learned predictor and compare it to other static predictors.
- A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows (published)
joint work with Tobias Harks
We study the computational complexity of Instantaneous Dynamic Equilibria (IDE) and show that a natural extension algorithm needs only finitely many phases to converge leading to the first finite time combinatorial algorithm computing an IDE. We complement this result by several hardness results showing that computing IDE with natural properties is NP-hard.
- Extended abstract in International Conference on Integer Programming and Combinatorial Optimization. IPCO 2021: https://doi.org/10.1007/978-3-030-73879-2_8
- Full version in Mathematical Programming (2022): https://doi.org/10.1007/s10107-022-01772-0
- Full version on arXiv: https://arxiv.org/abs/2007.07808
- The Price of Anarchy for Instantaneous Dynamic Equilibria (published)
joint work with Tobias Harks
We study the price of anarchy (PoA) for Instantaneous Dynamic Equilibria (IDE) and show an upper bound of order O(U⋅τ) for single-sink instances, where U denotes the total inflow volume and τ the sum of edge travel times. We complement this upper bound with a family of instances proving a lower bound of order Ω(U⋅logτ).
- Dynamic Flows with Adaptive Route Choice (published)
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 currently shortest path towards the respective sink. We measure current shortest path length by current waiting times in queues plus physical travel times. For single-sink networks we show existence and termination of IDE flows. For multi-sink networks we show existence and give an example for an instance where IDE flows never terminate.
If you find any mistakes in one of the papers or have any remarks on them, please do let me know. I am always thankful for all suggestions that might improve my work.
- Graduate Get Together (Augsburg), June „Dynamic Flows with Adaptive Route Choice“ (Slides)
- Dagstuhl-Seminar (Schloss Dagstuhl), May „Dynamic Traffic Assignment for Electric Vehicles“ (Slides)
- IPCO 2021 (Atlanta), May „A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows“ (Slides | Video | extended Video)
- WINE 2020 (Beijing), December „The Price of Anarchy for Instantaneous Dynamic Equilibria“ (Slides | Video)
- OMS-Seminar (Aachen), October „Instantaneous Dynamic Equilibrium Flows“ (Slides)
- Dagstuhl-Seminar (Schloss Dagstuhl), September „Computational Complexity of Instantaneous Dynamic Equilibrium Flows“ (Slides)
- Arbeitsseminar (Augsburg), June „Dynamic Flows with Adaptive Route Choice“ (Slides)
I have been a guest on the podcast Algo2Go, where I talked with the hosts Laura Vargas-Koch and Niklas Rieken about IDE flows (in German):
2017 - present: PhD Student
Since 2017 I am a PhD student of Tobias Harks at the University of Augsburg.
2014 - 2017: Mathematics M.Sc.
- Master's Thesis: „Zusammenhänge von Auslastungs- und Potentialspielen“ (Connections between Congestion and Potential Games), supervisor: Tobias Harks (pdf | LaTeX-Files | Slides)
- My personal notes for some of the lectures I attended during the course of my studies can be found here.
- Teachings: Exercise classes to the lectures „Lineare Algebra I/II“, „Analysis I/II“, Informatik III (Computer Science III), „Kombinatorische Optimierung“ (Combinatorial Optimiziation), a lecture on differentiation and integration in a repetition course for Analysis I (Slides) and tutor at „Offener Matheraum“
2014: Internship at Munich Re
2011 - 2014: Mathematics B.Sc.
- Bachelor's Thesis: „Der Satz von Gelfand-Neumark und eine Erweiterung für topologische Mannigfaltigkeiten“ (The Theorem of Gelfand-Neumark and an Extension for Topological Manifolds), supervisor: Kai Cieliebak (pdf | LaTeX-Files)
- My personal lecture notes for some of the lectures I attended during the course of my studies can be found here.
- Teachings: Exercise classes to the lectures „Logik für Informatiker“ (Logic for Computer Scientists) and „Einführung in die theoretische Informatik“ (Introduction to Theoretical Computer Sciences)