Ordinal Secretaries with Advice

We study the ordinal secretary problem, where a sequence of candidates arrives in uniformly random order, and the goal is to select the best candidate using only pairwise comparisons. We consider a learning-augmented setting that incorporates potentially erroneous predictions about the best candidate’s position. Our goal is to design online algorithms that balance robustness against poor predictions while having high performance when predictions are accurate. Using an optimization-based framework, we develop deterministic and randomized algorithms that extend classical strategies and explicitly model the trade-off between consistency and robustness. Also, we show the flexibility of our approach by applying it to multiple secretary problem variants, including multiple-choice and rehiring.

Authors

• Hasti Nourmohammadi University of Alberta, Alberta Machine Intelligence Institute
• Ying Cao School of Information Science and Technology, ShanghaiTech University
• Bo Sun
• Xiaoqi Tan

Keywords

No keywords are indexed for this paper.