Faculties / Central Institutes
DE / EN
The Discrete Optimization group is concerned with the development and analysis of algorithms for the solution of optimization problems on discrete structures such as graphs and matroids.
The paper Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians by Max Klimm and Philipp Warode has been accepted at SIAM Journal on Computing.
The paper Multi-Leader Congestion Games with an Adversary by Tobias Harks, Mona Henle, Max Klimm, Jannik Matuschke, and Anja Schedel has been accepted at Journal of Artificial Intelligence Research.
Max Klimm gave the talk Eine kurze Einführung in die Spieltheorie at the MATHINSIDE am Pi Day 2025.
Martin Knaack gave the talk Generalized Assignment and Knapsack Problems in the Random-Order Model at the 15th Day On Computational Game Theory.
