Secretaries with Advice
Paul D\"utting, Silvio Lattanzi, Renato Paes Leme, Sergei, Vassilvitskii

TL;DR
This paper introduces a unified model for secretary problems incorporating various advice types, providing structural insights and optimal algorithms through a linear programming approach.
Contribution
It develops a general LP framework that captures multiple secretary problem variants and derives optimal algorithms for each case.
Findings
LP-based analysis yields tight bounds for secretary with samples
Optimal algorithms identified for known distribution models
New model with noisy binary advice analyzed
Abstract
The secretary problem is probably the purest model of decision making under uncertainty. In this paper we ask which advice can we give the algorithm to improve its success probability? We propose a general model that unifies a broad range of problems: from the classic secretary problem with no advice, to the variant where the quality of a secretary is drawn from a known distribution and the algorithm learns each candidate's quality on arrival, to more modern versions of advice in the form of samples, to an ML-inspired model where a classifier gives us noisy signal about whether or not the current secretary is the best on the market. Our main technique is a factor revealing LP that captures all of the problems above. We use this LP formulation to gain structural insight into the optimal policy. Using tools from linear programming, we present a tight analysis of optimal algorithms for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
