All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
Game Theory on dividing cakes (Posted on 2004-12-27) Difficulty: 3 of 5
A well-known method of dividing a cake between two people is to have the first person to cut the cake and have the second person to have the first pick. This will guarantee that the first person will cut the cake in half so that the second person cannot leave him with a smaller piece.

Now we want to divide the cake among n people. Let's make the following assumptions:
(a) Each person cannot cut the cake more than once
(b) Everyone is logical
(c) Everyone wishes to get the largest possible piece
(d) Everyone wishes to narrow the gap with those who have a bigger piece than he does
(e) No one cares about anyone who has a smaller piece than themselves.

Can you generalize the strategy to n people? Give your logical steps/proof that this strategy will yield a fair result.

See The Solution Submitted by Bon    
Rating: 1.5000 (2 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Solutionpossible solAndrei2005-01-08 17:24:53
SolutionFair cuts...Erik O.2004-12-28 18:04:53
Some Thoughtsre: One fair cut deserves anotherSteve Herman2004-12-28 14:37:15
SolutionOne fair cut deserves anotherSteve Herman2004-12-28 14:23:45
It's Monday.....Penny2004-12-27 23:20:32
re: QuestionPenny2004-12-27 18:03:59
ClarificationsEric2004-12-27 16:56:50
QuestionQuestionPenny2004-12-27 16:10:35
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information