This article relies largely or entirely on a single source .(January 2013) |

The **pirate game** is a simple mathematical game. It is a multi-player version of the ultimatum game.

There are five rational pirates (in strict order of seniority A, B, C, D and E) who found 100 gold coins. They must decide how to distribute them.

The pirate world's rules of distribution say that the most senior pirate first proposes a plan of distribution. The pirates, including the proposer, then vote on whether to accept this distribution. If the majority accepts the plan, the coins are dispersed and the game ends. In case of a tie vote, the proposer has the casting vote. If the majority rejects the plan, 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. The process repeats until a plan is accepted or if there is one pirate left.^{ [1] }

Pirates base their decisions on four 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] } And finally, 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.

To increase the chance of his plan being accepted, one might expect that Pirate A will have to offer the other pirates most of the gold. However, this is far from the theoretical result. When each of the pirates votes, they won't just be thinking about the current proposal, but also other outcomes down the line. In addition, the order of seniority is known in advance so each of them can accurately predict how the others might vote in any scenario. This becomes apparent if we work backwards.

The final possible scenario would have all the pirates except D and E thrown overboard. Since D is senior to E, he has the casting vote; so, D would propose to keep 100 for himself and 0 for E.

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 one coin in this round to win E's vote. Therefore, when only three are left the allocation is C:99, D:0, E:1.

If B, C, D and E remain, B can offer 1 to D; because B has the casting vote, only D's vote is required. Thus, B proposes B:99, C:0, D:1, E:0.

(In the previous round, one might consider proposing B:99, C:0, D:0, E:1, as E knows it won't be possible to get more coins, if any, if E throws B overboard. But, as each pirate is eager to throw the others overboard, E would prefer to kill B, to get the same amount of gold from C.)

With this knowledge, A 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] }

(Note: 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.)

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:

- Pirate #201 as captain can stay alive only by offering all the gold one each to the lowest
*odd*-numbered pirates, keeping none. - Pirate #202 as captain can stay alive only by taking no gold and offering one gold each to 100 pirates who would not receive a gold coin from #201. Therefore, there are 101 possible recipients of these one gold coin bribes being the 100
*even*-numbered pirates up to 200 and number #201. Since there are no constraints as to*which*100 of these 101 he will choose, any choice is equally good and he can be thought of as choosing at random. This is how chance begins to enter the considerations for higher-numbered pirates. - Pirate #203 as captain will not have enough gold available to bribe a majority, and so will die.
- Pirate #204 as captain has #203's vote secured without bribes: #203 will only survive if #204 also survives. So #204 can remain safe by reaching 102 votes by bribing 100 pirates with one gold coin each. This seems most likely to work by bribing
*odd*-numbered pirates optionally including #202, who will get nothing from #203. However, it may also be possible to bribe others instead as they only have a 100/101 chance of being offered a gold coin by pirate #202. - With 205 pirates, all pirates bar #205 prefer to kill #205 unless given gold, so #205 is doomed as captain.
- Similarly with 206 or 207 pirates, only votes of #205 to #206/7 are secured without gold which is insufficient votes, so #206 and #207 are also doomed.
- For 208 pirates, the votes of self-preservation from #205, #206, and #207 without any gold are enough to allow #208 to reach 104 votes and survive.

In general, if G is the number of gold pieces and N (> 2G) is the number of pirates, then

- 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.
- Any pirate whose number is greater than 2G + M/2 will receive no gold.
- There is no unique solution as to who gets one gold coin and who does not if the number of pirates is 2G+2 or greater. A simple solution dishes out one gold to the
*odd*or*even*pirates up to 2G depending whether M is an even or odd power of 2.

Another way to see this is to realize that every M^{th} pirate will have the vote of all the pirates from M/2 + 1 to M out of self preservation since their survival is secured only with the survival of the Mth pirate. Because the highest ranking pirate can break the tie, the captain only needs the votes of half of the pirates over 2G, which only happens each time (2G + a Power of 2) is reached. For instance, with 100 gold pieces and 500 pirates, pirates #500 through #457 die, and then #456 survives (as 456 = 200 + 2^{8}) as he has the 128 guaranteed self-preservation votes of pirates #329 through #456, plus 100 votes from the pirates he bribes, making up the 228 votes that he needs. The numbers of pirates past #200 who can guarantee their survival as captain with 100 gold pieces are #201, #202, #204, #208, #216, #232, #264, #328, #456, #712, etc.: they are separated by longer and longer strings of pirates who are doomed no matter what division they propose.

- ↑ 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. - 1 2 3 Stewart, Ian (May 1999), "A Puzzle for Pirates" (PDF),
*Scientific American*, pp. 98–99

In number theory, two integers *a* and *b* are said to be **relatively prime**, **mutually prime**, or **coprime** if the only positive integer (factor) that divides both of them is 1. Consequently, any prime number that divides one does not divide the other. This is equivalent to their greatest common divisor (gcd) being 1.

In mathematics and computing, **hexadecimal** is a positional system that represents numbers using a base of 16. Unlike the common way of representing numbers with ten symbols, it uses sixteen distinct symbols, most often the symbols "0"–"9" to represent values zero to nine, and "A"–"F" to represent values ten to fifteen.

The **Collatz conjecture** is a conjecture in mathematics that concerns a sequence defined as follows: start with any positive integer n. Then each term is obtained from the previous term as follows: if the previous term is even, the next term is one half of the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that no matter what value of n, the sequence will always reach 1.

**Goldbach's conjecture** is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states:

In number theory, a **Gaussian integer** is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as **Z**[*i*]. This integral domain is a particular case of a commutative ring of quadratic integers. It does not have a total ordering that respects arithmetic.

The **Universal Product Code** (**UPC**) is a barcode symbology that is widely used in the United States, Canada, Europe, Australia, New Zealand, and other countries for tracking trade items in stores.

**Dynamic programming** is both a mathematical optimization method and a computer programming method. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, from aerospace engineering to economics.

The **Burnside problem**, posed by William Burnside in 1902 and one of the oldest and most influential questions in group theory, asks whether a finitely generated group in which every element has finite order must necessarily be a finite group. Evgeny Golod and Igor Shafarevich provided a counter-example in 1964. The problem has many variants that differ in the additional conditions imposed on the orders of the group elements.

The **guinea** was a coin of approximately one-quarter ounce of gold that was minted in Great Britain between 1663 and 1814. The name came from the Guinea region in West Africa, where much of the gold used to make the coins originated. It was the first English machine-struck gold coin, originally worth one pound sterling, equal to twenty shillings, but rises in the price of gold relative to silver caused the value of the guinea to increase, at times to as high as thirty shillings. From 1717 to 1816, its value was officially fixed at twenty-one shillings.

**Bartholomew Roberts**, born **John Roberts**, was a Welsh pirate who raided ships off the Americas and West Africa between 1719 and 1722. He was the most successful pirate of the Golden Age of Piracy as measured by vessels captured, taking over 400 prizes in his career. He is also known as **Black Bart**, but this name was never used in his lifetime.

The **Schulze method** is an electoral system developed in 1997 by Markus Schulze that selects a single winner using votes that express preferences. The method can also be used to create a sorted list of winners. The Schulze method is also known as **Schwartz Sequential dropping** (**SSD**), **cloneproof Schwartz sequential dropping** (**CSSD**), the **beatpath method**, **beatpath winner**, **path voting**, and **path winner**.

In game theory, **battle of the sexes** (**BoS**) is a two-player coordination game. Some authors refer to the game as **Bach or Stravinsky** and designate the players simply as Player 1 and Player 2, rather than assigning sex.

In game theory, the **core** is the set of feasible allocations that cannot be improved upon by a subset of the economy's agents. A coalition is said to *improve upon* or *block* a feasible allocation if the members of that coalition are better off under another feasible allocation that is identical to the first except that every member of the coalition has a different consumption bundle that is part of an aggregate consumption bundle that can be constructed from publicly available technology and the initial endowments of each consumer in the coalition.

The **coin problem** is a mathematical problem that asks for the largest monetary amount that cannot be obtained using only coins of specified denominations. For example, the largest amount that cannot be obtained using only coins of 3 and 5 units is 7 units. The solution to this problem for a given set of coin denominations is called the **Frobenius number** of the set. The Frobenius number exists as long as the set of coin denominations has no common divisor greater than 1.

**Circumscription** is a non-monotonic logic created by John McCarthy to formalize the common sense assumption that things are as expected unless otherwise specified. Circumscription was later used by McCarthy in an attempt to solve the frame problem. To implement circumscription in its initial formulation, McCarthy augmented first-order logic to allow the minimization of the extension of some predicates, where the extension of a predicate is the set of tuples of values the predicate is true on. This minimization is similar to the closed-world assumption that what is not known to be true is false.

The * Black Pearl* is a fictional ship in the

**Bertrand's box paradox** is a paradox of elementary probability theory, first posed by Joseph Bertrand in his 1889 work *Calcul des probabilités*.

* Pirate Master* was a CBS reality television show created by Mark Burnett which replaced the previous Mark Burnett show on CBS, Rock Star. It followed sixteen modern-day pirates on their quest for gold, which totaled US$1,000,000. The show was hosted by Cameron Daddo, and took place in the Caribbean island nation of Dominica. The show premiered on Thursday, May 31, 2007. The show also aired on CTV in Canada, Sky3 in the UK, premiered on June 21, 2007 on Network Ten in Australia, and premiered on July 4, 2007 on AXN Asia. On July 10 in the US, the show moved to Tuesdays at 10 p.m. (ET). In its Tuesday run, it would follow the 9 p.m. (ET) broadcast of

**The Ouse Valley Railway** was to have been part of the London, Brighton & South Coast Railway (LBSCR). It was authorised by an Act of Parliament and construction of the 20 miles (32 km) long line was begun, but not completed. It never opened to traffic.

A **balance puzzle** or **weighing puzzle** is a logic puzzle about balancing items—often coins—to determine which holds a different value, by using balance scales a limited number of times. These differ from puzzles that assign weights to items, in that only the relative mass of these items is relevant.

- 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.

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.