In this sharing game theory puzzle, 3 friends take turns taking from a jar of 1000 candies to share. For example, the 1st friend could take 500 candies, then the 2nd friend could take 400, and the 3rd friend would take the remaining 100.

No one wants to be seen as greedy, but no one wants to end up with the fewest candies either. As such, their goals are (in order of preference):

- Do not end up with the most candies, nor the fewest candies (a tie for most or fewest also fails this condition)
- End up with as many candies as possible

All of them are logical, rational, know each other’s goals, but cannot communicate before or during sharing. How many candies should each friend end up with?

View Solution