Optimal Stopping (37% Rule / Secretary Problem)

The mathematical solution to the problem of when to stop searching and commit: examine 37% of your options without committing (the 'exploration' phase), then commit to the next option that's better than anything you saw during exploration. This maximizes your probability of selecting the best option from a sequence. Applied to hiring, apartment hunting, dating, and any sequential decision where you can't go back to rejected options. The 37% rule solves the explore-exploit tradeoff: too little exploration risks committing too early; too much risks missing the best options.

When to use it

When making sequential, irreversible decisions with a defined search space; when the tension between exploring more options and committing is paralyzing; when hiring, selecting vendors, or making any choice from a sequence where rejected options can't be revisited.

How it can help

For any sequential decision with a known number of options: explore the first 37% without committing (just observe and calibrate), then commit to the first option that exceeds everything you saw during exploration. Hiring: if you'll interview 10 candidates, interview the first 4 as calibration (don't hire any), then hire the first subsequent candidate who beats all 4. Apartment hunting: if you'll see 20 apartments, use the first 7-8 to calibrate your standards, then take the first one that beats them all.