Secretaries with Advice 5: With Binary-Classifier Advice of Recall p and Specificity p′, the Optimal Success Probability Tends to ((1−p′)/p)^((1−p′)/p′)·e^((p−1)/p′)Research Paper
A secretary problem asks a decision maker to choose one candidate from a sequence, without being able to recall a rejected candidate. Each arrival reveals how the candidate compares with those seen earlier, but the decision maker does not know the candidate's final rank. A classifier can provide an additional Yes or No signal about whether the current…