1 citations · 2 across the 7 of their papers we have counts for
10 papers
Last-Iterate Convergence of Frank--Wolfe for Nonlinear Variational Inequalities on Polytopes
Tobias Harks
We consider the Frank--Wolfe algorithm for solving variational inequalities over compact polytopes under a monotone operator . The linear minimization oracle returns verti…
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…
Branch-and-Cut for Computing Approximate Equilibria of Mixed-Integer Generalized Nash Games
Aloïs Duguet, Tobias Harks, Martin Schmidt +1
Generalized Nash equilibrium problems with mixed-integer variables constitute an important class of games in which each player solves a mixed-integer optimization problem, where bo…
Minimal Regret Walras Equilibria for Combinatorial Markets
Aloïs Duguet, Tobias Harks, Martin Schmidt +1
We consider combinatorial multi-item markets and propose the notion of a -regret Walras equilibrium, which is an allocation of items to players and a set of item prices that ach…
Carbon Pricing in Traffic Networks
Svenja M. Griesbach, Tobias Harks, Max Klimm +2
We study how externality pricing can steer traffic toward Wardrop equilibria respecting prescribed budgets. Our multi-commodity model encompasses carbon pricing, cordon pricing, an…
Branch-and-Cut for Mixed-Integer Nash Equilibrium Problems
Aloïs Duguet, Tobias Harks, Martin Schmidt +1
We study Nash equilibrium problems with mixed-integer variables in which each player solves a mixed-integer optimization problem parameterized by the rivals' strategies. We disting…
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…
An Equilibrium Model for Schedule-Based Transit Networks with Hard Vehicle Capacities
Tobias Harks, Sven Jäger, Michael Markl +1
Modelling passenger assignments in public transport networks is a fundamental task for city planners, especially when deliberating network infrastructure decisions. A key aspect of…