Some brainiacs have a solution! (Though not one the average man can comprehend... maybe they'll release a cake-cutting phone app?)
"...For measurable utility functions, we find a fully polynomial-time algorithm for finding an approximate envy-free allocation of a cake..."
The solution that has always seemed to work for me is this:
ReplyDelete1. Determine number of people to be served: N
2. Determine amount of cake needed per person: C
3. Make way too much cake so that there are plenty of leftovers.
There's not really any special calculation there or any fancy cutting, just lots of baked goods.
Wow. That cake is sweet. I wish I would have thought of that. Cool...
ReplyDelete