3 citations · 3 across the 1 of their papers we have counts for
3 papers
cs.DS2018
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…
cs.DS2017
A Collection of Lower Bounds for Online Matching on the Line
Antonios Antoniadis, Carsten Fischer, Andreas Tönnis
In the online matching on the line problem, the task is to match a set of requests online to a given set of servers . The distance metric between any two points in $R\,\cup\…
cs.DS2016★ 3 cited
Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions
Thomas Kesselheim, Andreas Tönnis
The \emph{Temp Secretary Problem} was recently introduced by Fiat et al. It is a generalization of the Secretary Problem, in which commitments are temporary for a fixed duration. W…