Add to ORKGFair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values dierent parts of the cake can only be obtained by requesting users to "cut" pieces of the cake into specified ratios. One of the most interesting open questions is to determine the minimum number of cuts required to divide the cake fairly. It is known that O(N log N) cuts suffices, however, it is not known whether one can do better. We sho
A cake is a metaphor for a heterogeneous, divisible good. When two players divide such a good, ther...
AbstractThe algorithmic aspects of the following problem are investigated: n (≥2) persons want to cu...
We prove that in a certain cake cutting model, every fair cake division protocol for n players must ...
In Inthis this paper paper we weshow showhow howmathematics mathematics can can illuminate illuminat...
In the cake cutting problem, n=2 players want to cut a cake into n pieces so that every player gets ...
AbstractWhat is the minimum number of cuts needed to divide a cake among n players so that each play...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
In the cake cutting problem, n 2 players want to cut a cake into n pieces so that every player gets...
In the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player get...
In this article we explore the problem of chore division, which is closely related to a classical qu...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
We consider the well-known cake cutting problem in which a protocol wants to divide a cake among n&g...
Cake Cutting Algorithm is a metaphor for a worldwide problem that involve dividing some continuous o...
Imagine a cake that must be divided between a group of gluttonous children. To complicate matters, t...
A cake is a metaphor for a heterogeneous, divisible good. When two players divide such a good, ther...
AbstractThe algorithmic aspects of the following problem are investigated: n (≥2) persons want to cu...
We prove that in a certain cake cutting model, every fair cake division protocol for n players must ...
In Inthis this paper paper we weshow showhow howmathematics mathematics can can illuminate illuminat...
In the cake cutting problem, n=2 players want to cut a cake into n pieces so that every player gets ...
AbstractWhat is the minimum number of cuts needed to divide a cake among n players so that each play...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
In the cake cutting problem, n 2 players want to cut a cake into n pieces so that every player gets...
In the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player get...
In this article we explore the problem of chore division, which is closely related to a classical qu...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
We consider the well-known cake cutting problem in which a protocol wants to divide a cake among n&g...
Cake Cutting Algorithm is a metaphor for a worldwide problem that involve dividing some continuous o...
Imagine a cake that must be divided between a group of gluttonous children. To complicate matters, t...
A cake is a metaphor for a heterogeneous, divisible good. When two players divide such a good, ther...
AbstractThe algorithmic aspects of the following problem are investigated: n (≥2) persons want to cu...
We prove that in a certain cake cutting model, every fair cake division protocol for n players must ...