Dynamic programming and the secretary problem
A simple dynamic program is formulated and solved for the secretary problem in which one seeks to maximize the probability of hiring the best of N candidates who are interviewed in succession and who must be accepted or rejected at the interview. Numerical results for small N are given.
scientific article; zbMATH DE number 4160507
scientific article