11 citations · 11 across the 1 of their papers we have counts for
1 paper
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…