FoundationNumeric answer
Hiring the best candidate · Part 1 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.
With 3 candidates and k = 1, what is the probability of hiring the best?
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.
Learn the method
More games, decision theory and puzzles questions
- Two players take turns flipping a fair coin, and the first to flip heads wins.Foundation
- A die game with paid re-rolls, part 1 of 3Foundation
- You roll a fair die and may re-roll once, keeping the second value if you do.Applied
- In the secretary problem, what is the probability the optimal policy finds the…Applied
- You may roll a fair die up to three times and are paid the face value of the…Applied
- A fair coin is flipped until the first tail.Applied