Graduate Student Organization Seminar

Date: February 19, 2016

Time: 5:00PM - 6:30PM

Location: BLOC 220

Speaker: Roberto Barrera, Texas A&M University

Title: Envy-free division of cakes and necklaces

Abstract: The classical cake-cutting problem of Steinhaus asks how to fairly divide a cake among several players. Our notion of a fair division will be one in which each player believes that their piece of cake is at least as good as any other piece. We will present a solution to the classical cake-cutting problem using an approach by F.W. Simmons and then give two combinatorial analogues of the classical cake-cutting problem. This is joint work with Kathryn Nyman, Amanda Ruiz, Francis Edward Su, and Yan X. Zhang.