no code implementations • 14 Dec 2021 • Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, Anja Schedel
We show how to compute efficiently a best approximate equilibrium, that is, with smallest possible $\alpha$ among all $\alpha$-approximate equilibria of the given instance.
1 code implementation • 14 Sep 2021 • Lukas Graf, Tobias Harks, Kostas Kollias, Michael Markl
We study a dynamic traffic assignment model, where agents base their instantaneous routing decisions on real-time delay predictions.
no code implementations • 15 Jul 2020 • Lukas Graf, Tobias Harks
In particular, all existence results and computational methods are based on fixed-point theorems and numerical discretization schemes and no exact finite time algorithm for equilibrium computation is known to date.
Computer Science and Game Theory Computational Complexity Optimization and Control
