Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols
Claudia Lindner,
Joerg Rothe
Abstract:Cake-cutting protocols aim at dividing a "cake" (i.e., a divisible resource) and assigning the resulting portions to several players in a way that each of the players feels to have received a "fair" amount of the cake. An important notion of fairness is envy-freeness: No player wishes to switch the portion of the cake received with another player's portion. Despite intense efforts in the past, it is still an open question whether there is a finite bounded envy-free cake-cutting protocol for an arbitrary number… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.