The Patriarch’s Will – a game theory puzzle
Long-time reader Scott found the following puzzle from this site:
Here is a scenario which occurred many millennia ago: The patriarch of a wealthy family was on his deathbed and wanted to divide his gold among his eight sons who were all very, very greedy. Wishing to favor the oldest son (as tradition would have it) but also to reward the more cunning of his progeny, he made the following decree:
The oldest son is to propose a plan for dividing up the gold. The sons are all to vote on this plan, and if it receives at least half of the votes (four or more) then that will be the way the gold is divided. If this plan does not receive half of the votes, the oldest son gets nothing, the next oldest proposes a plan, and there is another vote, now among the remaining seven. Again at least half of the vote (still four or more) is required, and failure removes this son from the process. This is to continue until some son’s plan receives at least half of the votes of the remaining heirs.
Assuming that these sons will do anything to get the most gold possible for themselves, how much (if any) will the oldest son be able to inherit?
This is very much like an extended pirate’s game. Can you figure out the answer?
The solution
Scott also came up with the following well-written solution.
Reasoning Backwards
The last possible outcome is where Son 7 and Son 8 are voting on a plan. In this situation, Son 7 will be proposing the plan. Since only half of the votes are needed, whatever Son 7 proposes will be passed since Son 7 will naturally vote for his own plan. In this situation, Son 7 will end up with all the money and Son 8 will end up with none. Thus, it is in Son 8′s best interest to prevent it from coming to two people.
At three people, we have Son 6 proposing to Sons 7 and 8. Now, Son 6 knows that Son 8 does not want this vote to fail, since that will reduce it to two people, which is against his interests. Son 6 proposes that he gets all but $1, which goes to Son 8. Son 6 votes for this plan, being to his benefit. Son 7 votes against, since he gets nothing (and knows he stands to get everything if this continues). If Son 8 votes for the plan, he gets $1, if he votes against, he will ultimately get nothing. Thus, it is in Son 7′s best interest to prevent it from coming to three people.
At four people, we have Son 5 proposing to Sons 6, 7, and 8. Son 5 proposes that he gets all but $1, which goes to Son 7. Son 5 votes for his own plan. Son 6 votes against. Son 7, not wanting it to go any further, votes for, and Son 8 votes against. The 2-2 vote passes. Thus, Sons 6 and 8 will want to prevent it from coming to four people.
At five people we have Son 4 proposing to Sons 5, 6, 7, 8. He makes $1 offers to Sons 6 and 8, knowing they don’t want it to go any further, with the rest of the money staying with him. The vote ends up 3-2 (Sons 4, 6, and 8 vs. 5 and 7). Thus, Sons 5 and 7 will want to prevent it from coming to five people.
At six people, Son 3 is proposing. He makes $1 offers to Sons 5 and 7. The vote ends 3-3 with sons 4, 6, and 8 getting nothing. Thus, Sons 4, 6, and 8 will want to prevent it from coming to six people.
At seven people, Son 2 is proposing. He makes $1 offers to Sons 4, 6, and 8. The vote ends 4-3 with Sons 3, 5, and 7 getting nothing. Thus, Sons 3, 5, and 7 will want to prevent it from coming to seven people.
Lastly, with all eight sons, the eldest son, Son 1 will be proposing. Knowing all of the above he will propose $1 to Sons 3, 5, and 7. The vote will end 4-4, with Sons 4, 6, and 8 getting nothing.
Generalization
In a Pirate’s Game of N players–and gold pieces outnumber players–if the players are labeled 1, 2 …` N, in order of of first to last proposer, player 1 should make a nominal offer to the odd-numbered players 3, 5, 7, etc., and keep the remaining wealth for himself.
It is interesting to note the Pirate’s Game can be extended to arbitrary number of pirates. The situation gets interesting when there are 100 gold pieces and 200 pirate or 500 pirates. The results are astonishing–the weaker pirates manage to survive–and the full write up is in an old issue of Scientific American.
Share this post:
Previous post: Saving money on a plumber – game theory in practice
Next post: Legopoly





