typodupeerror

## How To Share a Cake Over the Internet123

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."
This discussion has been archived. No new comments can be posted.

## How To Share a Cake Over the Internet

• #### Right.. (Score:5, Funny)

by Anonymous Coward on Friday April 06, 2012 @10:17PM (#39604057)

The Cake is a Lie

• #### Re:Right.. (Score:4, Funny)

<kcocknozzle@ h o t m a i l.com> on Friday April 06, 2012 @10:18PM (#39604067) Homepage

Riiiiight... There is no cake!

Fucking matrix again...

• #### Re:Just cut the pieces into equal portions?! (Score:5, Funny)

on Friday April 06, 2012 @10:29PM (#39604119)

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)

on Friday April 06, 2012 @11:01PM (#39604211)

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)

by Anonymous Coward on Friday April 06, 2012 @11:33PM (#39604357)

And what resource isn't finite?

Human stupidity.

#### Related LinksTop of the: day, week, month.

The number of computer scientists in a room is inversely proportional to the number of bugs in their code.

Working...