Selecting with History
Data Structures and Algorithms
2018-09-27 v3
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.
Cite
@article{arxiv.1702.03989,
title = {Selecting with History},
author = {Tom Hess and Sivan Sabato},
journal= {arXiv preprint arXiv:1702.03989},
year = {2018}
}