1 citations · 1 across the 7 of their papers we have counts for
4 papers · 1 filter
Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians
Max Klimm, Philipp Warode
We show that computing an equilibrium in atomic splittable congestion games with player-specific affine cost functions is -complet…
Tight bounds for undirected graph exploration with pebbles and multiple agents
Yann Disser, Jan Hackfeld, Max Klimm
We study the problem of deterministically exploring an undirected and initially unknown graph with vertices either by a single agent equipped with a set of pebbles, or by a set…
Computing all Wardrop Equilibria parametrized by the Flow Demand
Max Klimm, Philipp Warode
We develop an algorithm that computes for a given undirected or directed network with flow-dependent piece-wise linear edge cost functions all Wardrop equilibria as a function of t…
The Online Best Reply Algorithm for Resource Allocation Problems
Max Klimm, Daniel Schmand, Andreas Tönnis
We study the performance of a best reply algorithm for online resource allocation problems with a diseconomy of scale. In an online resource allocation problem, we are given a set…