Skip to content
LeetQuant

Hard · Brain Teasers & Logic · Numerical · ~12 min · #16

Five Pirates Split the Gold

Five perfectly rational pirates of strictly ranked seniority (A > B > C > D > E) must divide 100 indivisible gold coins. The most senior surviving pirate proposes a split, and all surviving pirates vote, including the proposer. If at least half vote yes, the split is accepted. Otherwise the proposer is thrown overboard and the next most senior pirate proposes.

Each pirate's priorities, in order: (1) survive, (2) maximise their own coins, (3) all else equal, prefer to see others thrown overboard (so they vote no when indifferent).

How many coins does pirate A keep?

Hints · 0 of 2 shown

Worked solution

Give the problem an honest attempt first, then reveal the full explanation.

Related questions

Concepts

Backward inductionSubgame perfection

Relevant for

Quant TraderQuant Researcher