21 citations · 71 across the 19 of their papers we have counts for
30 papers
A Robust Perceptron Cycling Theorem and Applications
Tobias Harks
The classical perceptron cycling theorem of Block and Levin \cite{BlockLevin1970} bounds correction sequences whose selected updates come from a finite set and have nonpositive inn…
Monotonicity, Uniqueness and Frank--Wolfe Dynamics in Atomic Splittable Congestion Games
Tobias Harks
We study atomic splittable congestion games with players and nondecreasing resource costs with convex . We characterize the largest resource cost…
When do Mixed-Integer Games Admit Rational Equilibria?
Aloïs Duguet, Tobias Harks, Martin Schmidt +1
We consider mixed-integer linear-quadratic generalized Nash equilibrium problems, i.e., games in which each player solves a mixed-integer program subject to linear constraints in h…
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…
Multi-Leader Congestion Games with an Adversary
Tobias Harks, Mona Henle, Max Klimm +2
We study a multi-leader single-follower congestion game where multiple users (leaders) choose one resource out of a set of resources and, after observing the realized loads, an adv…