All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Elegantly Greedy Pirates (Posted on 2013-04-20)
You have 1000 pirates, who are all extremely greedy, heartless, and perfectly rational. They're also aware that all the other pirates share these characteristics. They're all ranked by the order in which they joined the group, from pirate one down to a thousand.

They've stumbled across a huge horde of treasure, and they have to decide how to split it up. Every day they will vote to either kill the lowest ranking pirate, or split the treasure up among the surviving pirates. If 50% or more of them vote to split it, the treasure gets split. Otherwise, they kill the lowest ranking pirate and repeat the process until half or more of the pirates decide to split the treasure.

The question, of course, is at what point will the treasure be split, and what will the precise vote be?

After that, consider solving the problem when a two-thirds or three-fourths majority is required. Try to generalize the result.

 No Solution Yet Submitted by Danish Ahmed Khan Rating: 3.0000 (2 votes)

 Subject Author Date re: Power of the supermajority (spoiler) broll 2013-04-21 01:59:55 re: Power of the supermajority (spoiler) Dej Mar 2013-04-21 00:32:42 Scenarios where nobody needs to die Steve Herman 2013-04-20 23:34:02 Power of the supermajority (spoiler) Steve Herman 2013-04-20 22:42:58 Power of the majority (spoiler) Steve Herman 2013-04-20 12:59:29

 Search: Search body:
Forums (0)