4 papers
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…
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…