How To Share a Cake Over the Internet 123
mikejuk writes "The problem to be solved sounds trivial — cut up a cake so that each person thinks they get a fair share. This classical problem gets even more difficult if the 'players' can't all see what is going on at the same time — for example because they are negotiating via the internet. Now there is an asynchronous algorithm that is guaranteed to be fair and it all depends on using an encrypted auction. The new algorithm is simple and easy to use, and might be the solution to any number of difficult situations where people need to share things so that everyone comes away happy."
Right.. (Score:5, Funny)
The Cake is a Lie
Re:Right.. (Score:4, Funny)
Riiiiight... There is no cake!
Fucking matrix again...
Re:Just cut the pieces into equal portions?! (Score:5, Funny)
If the players can't see what's being done (as per TFS), then the following method should work perfectly:
-(BOOL)isSliceFair:(Slice *)slice {
return YES;
}
Related: http://xkcd.com/221/ [xkcd.com]
Re:Give an Even Better Algorithm (Score:5, Funny)
What I really want is algorithm that allows me to have my cake and eat it too [wikipedia.org].
Easy one. Buy two cakes. qed
Re:analogs (Score:4, Funny)
And what resource isn't finite?
Human stupidity.