Pirates divide gold coins

Original title Five pirates robbed 100 jewels, each of which was the same size and priceless. They decided to divide it like this:

1. Draw lots to decide your own number (1, 2, 3, 4, 5)

2. First, 1 put forward the distribution plan, and then five people voted. When and only when more than half of the people agree, they will be distributed according to his proposal, otherwise they will be thrown into the sea to feed sharks.

3. If not. 1 dead, the distribution plan will be put forward on the 2 nd, and then four people will vote. If and only if more than half of the people agree, they will be distributed according to his proposal, otherwise they will be thrown into the sea to feed sharks.

4. By analogy

Conditions: Every pirate is a very smart person who can rationally judge gains and losses and make choices.

Question: What distribution scheme did the first pirate propose to maximize his income?

Answer:

Five pirates 100 gold coins. No one can come up with a plan, and most people agree that the plan can be passed. Anyone who fails to pass the plan will throw it into the sea to feed the fish. They first draw lots to decide their own order, and then put forward their own plans in turn. Q: How does No.65,438+0 save its own life and get the maximum benefit?

Push from back to front. If 1-3 robbers all feed sharks, there are only No.4 and No.5 left, and No.5 will definitely vote against it, so that No.4 will feed sharks and take all the gold coins. Therefore, No.4 can only save his life by supporting No.3. Knowing this, No.3 will put forward a distribution plan (100,0,0), which will leave all the gold coins to No.4 and No.5, because he knows that No.4 has got nothing, but he will still vote for it. With his own vote, his plan will be passed. However, if No.2 infers the scheme to No.3, it will propose a scheme of (98,0, 1, 1), that is, give up No.3 and give No.4 and No.5 a gold coin each. Since the plan is more favorable to No.4 and No.5 than No.3, they support him and don't want him to be out and assigned by No.3 ... So No.2 took 98 gold coins. However, the scheme of No.2 will be known by 1, and 1 will put forward the scheme of (97,0, 1, 2,0) or (97,0, 1, 0,2), that is, give up No.2 and give No.3 a gold coin at the same time. Because the plan of 1 is better for No.3 and No.4 (or No.5) than No.2, they will vote for 1, plus 1, and the plan of 1 will be passed, and 97 gold coins can be easily put in the bag. This is undoubtedly the scheme that 1 can get the greatest benefit.

Thank you for your answer ~ ~ Thank you