no code implementations • 18 Jan 2021 • Xujun Liu, Olgica Milenkovic, George V. Moustakides
We study the secretary problem in which rank-ordered lists are generated by the Mallows model and the goal is to identify the highest-ranked candidate through a sequential interview process which does not allow rejected candidates to be revisited.
Methodology Discrete Mathematics Information Theory Combinatorics Information Theory 05A
