This is the awe inspiring bit: > One reason why the secretary problem has received so much attention is that the optimal policy for the problem (the stopping r

This is the awe inspiring bit: > One reason why the secretary problem has received so much attention is that the optimal policy for the problem (the stopping rule) is simple and selects the single best candidate about 37% of the time, irrespective of whether there are 100 or 100 million applicants. Another example of how our intuitions are poor at probabilities. 100M! Might give that a Monty Carlo sim. Or even try it on a big DB table at work.