11 citations · 48 across the 34 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 11 cited
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
Thomas Kesselheim, Andreas Tönnis
We study various generalizations of the secretary problem with submodular objective functions. Generally, a set of requests is revealed step-by-step to an algorithm in random order…
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…