Games, decision theory and puzzles
Hiring the best candidate, part 3 of 3
Hiring the best candidate · Part 3 of 3
Candidates arrive in a random order and can be ranked against everyone seen so far. Each must be hired or rejected on the spot. The strategy is to reject the first k and then hire the first candidate better than all of them.
As the number of candidates grows large, what probability of hiring the best does the optimal rule achieve?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
More games, decision theory and puzzles questions
- You roll a fair die and may re-roll once, keeping the second value if you do.Applied · Free solution
- You may re-roll a fair die as often as you like, free of charge, and are paid…Advanced · Free solution
- A company is worth V to its owner, uniform between 0 and 100, and only the owner knows V.Advanced · Premium
- A die game with paid re-rolls, part 3 of 3Advanced · Premium
- A shuffled deck of 26 red and 26 black cards is turned over one card at a time.Expert · Premium
- Two players take turns flipping a fair coin, and the first to flip heads wins.Foundation · Premium