Fair partitioning? It's a piece of cake!

Abstract: Is it always possible to cut a cake and distribute the pieces so that everyone at a party gets the piece they most desire? We'll show that when it comes to cutting cakes, the old adage that you can't please everybody is dead wrong: Everyone can have their cake and eat it, too. Also, we'll prove Brouwer's fixed point theorem without using any topology.

Computer scienceMathematicsPhysics

Audience: researchers in the topic

MIT Simple Person's Applied Mathematics Seminar