Reference no: EM132294692

Five pirates, called Ann, Brenda, Carla, Danielle and Emily, found a treasure of 100 gold coins. On their ship, they decide to split the coins using the following scheme:

• The first pirate in alphabetical order becomes the chief pirate.
• The chief proposes how to share the coins, and all other pirates (excluding the chief) vote for or against it.
• If 50% or more of the pirates vote for it, then the coins will be shared that way.
• Otherwise, the chief will be thrown overboard, and the process is repeated with the pirates that remain.

Thus, in the first round Ann is the chief: if her proposal is rejected, she is thrown overboard and Brenda becomes the chief, etc; if Ann, Brenda, Carla, and Danielle are thrown overboard, then Emily becomes the chief and keeps the entire treasure.

The pirates' first priority is to stay alive: they will act in such a way as to avoid death. If they can stay alive, they want to get as many coins as possible. Finally, they are a blood-thirsty bunch, if a pirate would get the same number of coins if she voted for or against a proposal, she will vote against so that the pirate who proposed the plan will be thrown overboard.

Assuming that all 5 pirates are intelligent (and aware that all the other pirates are just as aware, intelligent, and bloodthirsty), what will happen? The solution should indicate which pirates die, and how many coins each of the remaining pirates receives.