Usenet Newsgroups : rec.puzzles Hall of FameThe rec.puzzles Hall of Fame is a compilation of over 500 of the most popular puzzles that have been posted and discussed in the rec.puzzles newsgroup. In most cases a detailed solution has been provided. Many of these puzzles also appear in Braingle's own collection. |
| |||||||||||||||
N-Person Fair Division If two people want to divide a pie but do not trust each other, they can still ensure that each gets a fair share by using the technique that one person cuts and the other person chooses. Generalize this technique to more than two people. Take care to ensure that no one can be cheated by a coalition of the others.
Solution


