## 5 friends want to divide 100 candies among them, they all are very intelligent,treacherous and selfish. Let’s number them 1 to 5 and

5 friends want to divide 100 candies among them, they all are very intelligent,treacherous and selfish.

Let’s number them 1 to 5 and consider the lowest number to be the leader.

Leader proposes a distribution of the candies. All other friends vote on the proposal, and if half of them say “Yes”, the candies are divided as proposed, as no friend would be willing to take on the leader without superior force on their side.

If the leader fails to obtain support of at least half his friends(which includes himself), he faces a mutiny, and all friends make him leave. The leader start over again with the next lowest number as leader.

What is the maximum number of candies the leader(number 1) can achieve if they all choose optimally.

## Answers ( )

Answer:There are 5 pirates, they must decide how to distribute 100 gold coins among them. The pirates have seniority levels, the senior-most is A, then B, then C, then D, and finally the junior-most is E.

Rules of distribution are:

The most senior pirate proposes a distribution of coins.

All pirates vote on whether to accept the distribution.

If the distribution is accepted, the coins are disbursed and the game ends.

If not, the proposer is thrown and dies, and the next most senior pirate makes a new proposal to begin the system again.

In case of a tie vote the proposer can has the casting vote.