Five pirates splitting a hundred gold coins
Question
Five pirates, ranked (most junior) to (most senior), must divide gold coins. The most senior surviving pirate proposes an allocation and everyone still aboard, the proposer included, votes. The plan is adopted if at least half the votes are in favour; if a strict majority votes against, the proposer is thrown overboard and the next most senior pirate proposes. If only one pirate is left he keeps all . Each pirate values survival first and then coins, and all reason perfectly. How many coins does pirate keep under his best proposal? (Answer if he is always thrown overboard.)
Short answer
. Work backwards. With pirates , pirate keeps all (his own vote is half). With three, pirate buys pirate for one coin. With four, pirate needs one more vote and buys pirate for one coin. With five, pirate needs two extra votes and buys pirates and (who get nothing otherwise) with one coin each, keeping .
Adapted from QuantQuestions.io; question and answer rewritten by SelfMadeQuant.com.
See the hint and the full worked solution in the question bank (free account).
Open the worked solutionLessons behind this question
- Conditional Probability, Total Probability, and Bayes' Rule
- Worked Examples — Probability Trees, Monty Hall, and Bayesian Updating
- Optimisation Problems
Start with a free lesson: Probability Fundamentals is part of a free topic. Create a free account, no card needed, to read it in full with worked solutions.
Read it free