The submodular secretary problem under a cardinality constraint and with limited resources.

Tom Hess, Sivan Sabato

Abstract: We define a new selection problem, \emph{Selecting with History}, which extends the secretary problem to a setting with historical information. We propose a strategy for this problem and calculate its success probability in the limit of a large sequence.