9 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…
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…
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…
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 ac…
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…
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…