A practical strategy for secretary problem
Yang Cheng, Xubin Luo, Bin Chen · Systems Engineering - Theory & Practice · 2012
Cut-off rule is the most common approach for solving the secretary problem(SP).Most previous work assumes fixed benchmark used in an application and does not give quantitative analysis of the relationship between the threshold and the benchmark.In this paper we show the impacts of the threshold and benchmark on the expected ranking of the obtained results,pointing out that the frame of reference in solving the SP is more important than the decision-making time.We propose a practical solution based on socrates' trichotomy for the SP with less than 100 candidates.This solution takes the first one-third of the candidates as the sample set and applies flexible benchmark—from the first to the third one when examining the rest of the candidates.The method is simple and practical.And simulation shows that the average performance of our solution is very close(95%) to the best theoretical solution.