Open Access Articles- Top Results for Pirate game

Pirate game

For other uses, see Pirate (disambiguation)#Games.

The pirate game is a simple mathematical game. It illustrates how, if assumptions conforming to a homo economicus model of human behaviour hold, outcomes may be surprising. It is a multi-player version of the ultimatum game.

The game

There are 5 rational pirates, A, B, C, D and E. They find 100 gold coins. They must decide how to distribute them.

The pirates have a strict order of seniority: A is superior to B, who is superior to C, who is superior to D, who is superior to E.

The pirate world's rules of distribution are thus: that the most senior pirate should propose a distribution of coins. The pirates, including the proposer, then vote on whether to accept this distribution. In case of a tie vote the proposer has the casting vote. If the distribution is accepted, the coins are disbursed and the game ends. If not, the proposer is thrown overboard from the pirate ship and dies, and the next most senior pirate makes a new proposal to begin the system again.[1]

Pirates base their decisions on three factors. First of all, each pirate wants to survive. Second, given survival, each pirate wants to maximize the number of gold coins he receives. Third, each pirate would prefer to throw another overboard, if all other results would otherwise be equal.[2] The pirates do not trust each other, and will neither make nor honor any promises between pirates apart from a proposed distribution plan that gives a whole number of gold coins to each pirate.

The result

It might be expected intuitively that Pirate A will have to allocate little if any to himself for fear of being voted off so that there are fewer pirates to share between. However, this is quite far from the theoretical result.

This is apparent if we work backwards: if all except D and E have been thrown overboard, D proposes 100 for himself and 0 for E. He has the casting vote, and so this is the allocation.

If there are three left (C, D and E) C knows that D will offer E 0 in the next round; therefore, C has to offer E 1 coin in this round to make E vote with him, and get his allocation through. Therefore, when only three are left the allocation is C:99, D:0, E:1.

If B, C, D and E remain, B considers what will happen if he is thrown overboard, when he makes his decision. To avoid being thrown overboard, he can simply offer 1 to D. Because he has the casting vote, the support only by D is sufficient. Thus he proposes B:99, C:0, D:1, E:0. One might consider proposing B:99, C:0, D:0, E:1, as E knows he won't get more, if any, if he throws B overboard. But, as each pirate is eager to throw each other overboard, E would prefer to kill B, to get the same amount of gold from C.

Assuming A knows all these things, he can count on C and E's support for the following allocation, which is the final solution:

  • A: 98 coins
  • B: 0 coins
  • C: 1 coin
  • D: 0 coins
  • E: 1 coin[2]

Also, A:98, B:0, C:0, D:1, E:1 or other variants are not good enough, as D would rather throw A overboard to get the same amount of gold from B.

Please do not edit this answer without discussing it on the Talk Page


The solution follows the same general pattern for other numbers of pirates and/or coins, however the game changes in character when it is extended beyond there being twice as many pirates as there are coins. Ian Stewart wrote about Steve Omohundro's extension to an arbitrary number of pirates in the May 1999 edition of Scientific American and described the rather intricate pattern that emerges in the solution.[2]

Supposing there are just 100 gold pieces, then:

  • If Pirate #201 is captain, he can stay alive only by offering all the gold to odd-numbered pirates, keeping none for himself.
  • If #202 is captain, he can stay alive only by offering all the gold to even-numbered pirates, keeping none for himself.
  • If #203 is captain, there isn't enough gold available to bribe a majority, so he will die.
  • If #204 is captain, he has #203's vote secured without having to bribe him: #203 will only survive if #204 also survives. So #204 is safe by making the same offer as #201 would make, bribing the first 100 odd-numbered pirates, who will get nothing from #202 if #204 and #203 both die.
  • Because #204 is safe, #203 doesn't care if #205 dies, so #205 is doomed if he becomes captain, and likewise #206 and #207.
  • The votes of self-preservation from #205, #206, and #207 are enough to ensure the safety of #208, if he makes the same offer as #202 would make, bribing the first 100 even-numbered pirates, who will get nothing from #204 if #208 to #205 all die.

In general, if G is the number of gold pieces and N (> 2G) is the number of pirates, then no pirate whose number exceeds 2G can expect any gold. Further:

  • All pirates whose number is less than or equal to 2G + M will survive, where M is the highest power of 2 that does not exceed N – 2G.
  • Any pirates whose number exceeds 2G + M will die.
  • The gold will go to those of the first 2G pirates whose numbers have the opposite parity to log2 M (that is, the odd numbers if M is an even power of 2; the even numbers if M is an odd power of 2).

Another way to see this is to realize that every Mth pirate will have the vote of all the pirates from M/2 to M out of self preservation, and will lose the vote of every pirate from 2G to M/2, since their survival is secured with the survival of the M/2th pirate. Because the highest ranking pirate can break the tie, he only needs half of the pirates over 2G to vote for him, which happens at every power of 2 from 2G onwards.

See also


  1. ^ Bruce Talbot Coram (1998). Robert E. Goodin, ed. The Theory of Institutional Design (Paperback ed.). Cambridge University Press. pp. 99–100. ISBN 978-0-521-63643-8. 
  2. ^ a b c Stewart, Ian (May 1999), "A Puzzle for Pirates" (PDF), Scientific American: 98–99 


  • Robert E. Goodin, ed. (1998). "Chapter 3: Second best theories". The Theory of Institutional Design. Cambridge University Press. pp. 90–102. ISBN 978-0-521-63643-8.