Before revision: upright=1.3|Graphs of probabilities of getting the best candidate (red circles) from n applications, and k/n (blue crosses) where k is the sample size The secretary problem (whose demonstrates a scenario involving optimal stopping theory For French translation, see cover story in the July issue of Pour la Science (2009).
After revision: upright=1.3|Graphs of probabilities of getting the best candidate (red circles) from n applications, and k/n (blue crosses) where k is the sample size The secretary problem demonstrates a scenario involving optimal stopping theory For French translation, see cover story in the July issue of Pour la Science (2009).