Eyjafjallajökull Lecture 2019
summary
Explains the secretary problem with a live audience game plus a simple random candidate generator and vote napkins, demonstrates the look-then-leap strategy and derives the 37% rule: inspect the first ~37% of applicants then pick the next one who beats all seen so far. Shows simulations and on-stage play where optimal stopping yields ~37% success regardless of N, applies to hiring a scrum master and to a dating example, and publishes the source used.
AI-written summary · about
chapters (9)
- 0:00Welcome
- 1:44Pronouncing Eyjafjallajökull
- 8:29From Scala World 2016
- 14:03Avoiding offense
- 24:31Secretary problem
- 33:2137% rule
- 40:08Math in life choices
- 44:44Scrum Master Cola problem
- 46:20Summary
related talks
59mStanding on the Shoulders of Giants: Unlocking our Future
43mThe Eyjafjallajökull Lecture
27mSmall Value Parallel Repetition for General Games
23mHow to Cheat at “Who Wants to Be a Millionaire?” (and Show Non-Hardness of GapMCSP)
33mWelfare Maximization with Limited Interaction: Information and Communication in Economics
01h 10mDistribution Estimation and Applications I
23mDevoxx: A Journey Through the Past, Present, and Future
50mComputer History RetroSpective: From Space Race to genAI with Live Demos