The Secretary Problem: Picking from the Top 10 Percent

  • 1 view
  • Last updated
  • Mathematics

About this lecture

A hundred houses arrive one at a time in random order. You accept or reject each on the spot, and a rejected house is gone for good. Aiming for the single best house is famously hard, and even the optimal plan wins only about thirty seven times in a hundred. Aiming instead for any of the ten best changes everything. This lecture builds the cutoff rule by hand: look at thirty seven houses and buy nothing, take the best of them as your bar, then buy the first house that clears it. Counting on screen shows why that bar is almost always already in the top ten, why anything clearing it is then a winner with certainty, and how relaxing the bar near the end of the list removes the one way the plan can fail.

Transcript

Loading discussion…