Quant Memo
Core

The Ski-Rental Problem

A classic online-decision puzzle: rent skis each day for a small fee or buy them once for a larger upfront cost, without knowing in advance how many days you'll actually ski — the optimal strategy caps your worst-case regret at 2x the best fixed choice in hindsight.

You're going on a ski trip of unknown length. Renting skis costs $1 per day; buying them outright costs $B once, and after buying you ski for free. If you knew in advance how many days you'd ski, the answer would be trivial: rent if the trip is shorter than BB days, buy if it's longer. The ski-rental problem asks what to do when you don't know the trip length in advance and must decide each morning, using only what has happened so far.

The standard solution: rent every day up until you've paid a cumulative BB in rental fees, then buy on that day. Compare this rule's cost against the best decision you could have made in hindsight, for every possible trip length. If the trip turns out shorter than BB days, you paid exactly what the hindsight-optimal renter would have paid — no loss. If the trip runs long, you paid BB in rental fees before buying, plus the purchase price BB, for a total of 2B2B — exactly double what a hindsight buyer would have paid for the same trip, and this ratio of 2 is provably the best any strategy can guarantee against every possible trip length. This worst-case-to-best-case ratio is called the competitive ratio, and 2 is the minimum achievable competitive ratio for this problem with a deterministic strategy.

Interviewers use this puzzle to test comfort with decision-making under total uncertainty about the future, and it generalizes directly to real trading problems like deciding when to switch from a flexible short-term hedge into a fixed long-term one.

Renting until cumulative rental cost hits the buy price, then buying, guarantees paying at most twice what the best strategy in hindsight would have paid — no deterministic rule can guarantee a better worst-case ratio than 2.

Practice in interviews

Further reading

  • Karlin, Manasse, Rudolph & Sleator, Competitive Snoopy Caching (1988)
ShareTwitterLinkedIn