The Secretary Problem Says Men Should Lock In a Partner by 24.3

The 37% rule is a well-known algorithm for hire/no-hire decisions, but applying it to a fixed personal timeline makes the cost of delay concrete. Every year past 24.3 that someone keeps searching raises the odds they settle for whoever is left when the window closes.

The optimal stopping algorithm known as the secretary problem sets the observation period at 37% of the total window. For a man seriously dating from 18 to 35, that means spending the first 6.3 years building a baseline without committing, then immediately choosing the first person who beats everyone seen before. The math lands the inflection point at 24.3 years old, which matches the folk wisdom that men should find a partner before 25.

Simulations across 20,000 trials show the 37% rule succeeds 38.5% of the time, compared to roughly 5% for picking randomly, picking the first candidate, or waiting until the last. Parameter sweeps confirm the success-rate peak sits squarely in the 36–42% skip range, corresponding to ages 24.1–24.8. The curve collapses quickly on both sides: too little observation means no reliable baseline, and too much means the best candidate has already passed.

Several real-world factors can shift the exact age. Non-uniform candidate pools, the possibility of going back to an ex, and lowering standards from "best" to "good enough" all pull the decision point earlier. But for any reasonable estimate of total serious partners (N between 5 and 30), the optimal skip ratio stays locked between 33% and 40%, keeping the inflection point in the 23–25 range regardless.