Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compared. For 2 persons, cut-and-choose, while envy-free and efficient, limits the cutter to exactly 50 % if he or she is ignorant of the chooser’s preferences, whereas the chooser can generally obtain more. By comparison, a new 2-person surplus procedure (SP), which induces the players to be truthful in order to maximize their minimum allocations, leads to a proportionally equitable division of the surplus—the part that remains after each player receives 50%—by giving each person exactly the same proportion of the surplus as he or she values it. For n ≥ 3 persons, a new equitable procedure (EP) yields a maximally equitable division of a cake. Thi...
In Inthis this paper paper we weshow showhow howmathematics mathematics can can illuminate illuminat...
We study the problem of fairly allocating a divisible resource, also known as cake cutting, with an ...
AbstractWe extend a result of Knaster and Woodall to the envy-free context by providing a constructi...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
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...
Properties of discrete cake-cutting procedures that use a minimal number of cuts (n-1 if there are n...
A cake is a metaphor for a heterogeneous, divisible good. When two players divide such a good, ther...
We describe a 3-person, 2-cut envy-free cake-cutting algorithm, inspired by a continuous moving-knif...
We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if...
In this article we explore the problem of chore division, which is closely related to a classical qu...
We study the problem of fair division of a heterogeneous resource among strategic players. Given a d...
A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake ...
Fair cake-cutting is the division of a cake or resource among N users so that each user is content....
In Inthis this paper paper we weshow showhow howmathematics mathematics can can illuminate illuminat...
We study the problem of fairly allocating a divisible resource, also known as cake cutting, with an ...
AbstractWe extend a result of Knaster and Woodall to the envy-free context by providing a constructi...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
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...
Properties of discrete cake-cutting procedures that use a minimal number of cuts (n-1 if there are n...
A cake is a metaphor for a heterogeneous, divisible good. When two players divide such a good, ther...
We describe a 3-person, 2-cut envy-free cake-cutting algorithm, inspired by a continuous moving-knif...
We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n-1 if...
In this article we explore the problem of chore division, which is closely related to a classical qu...
We study the problem of fair division of a heterogeneous resource among strategic players. Given a d...
A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake ...
Fair cake-cutting is the division of a cake or resource among N users so that each user is content....
In Inthis this paper paper we weshow showhow howmathematics mathematics can can illuminate illuminat...
We study the problem of fairly allocating a divisible resource, also known as cake cutting, with an ...
AbstractWe extend a result of Knaster and Woodall to the envy-free context by providing a constructi...