Add to ORKGIn the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player gets a "fair" share of the cake by his own measure. We describe a protocol with n - 1 cuts in which each player can enforce to get a share of at least 1/(2n - 2) of the cake. Moreover we show that no protocol with n - 1 cuts can guarantee a better fraction
In the cake cutting problem, n ≥ 2 playerswanttocuta cake into n pieces so that every player gets a ...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
AbstractThe algorithmic aspects of the following problem are investigated: n (≥2) persons want to cu...
In the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player get...
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 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...
We consider the well-known cake cutting problem in which a protocol wants to divide a cake among n&g...
In the cake cutting problem, n ≥ 2 playerswanttocuta cake into n pieces so that every player gets a ...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
AbstractThe algorithmic aspects of the following problem are investigated: n (≥2) persons want to cu...
In the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player get...
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 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...
We consider the well-known cake cutting problem in which a protocol wants to divide a cake among n&g...
In the cake cutting problem, n ≥ 2 playerswanttocuta cake into n pieces so that every player gets a ...
Procedures to divide a cake among n people with n-1 cuts (the minimum number) are analyzed and compa...
AbstractThe algorithmic aspects of the following problem are investigated: n (≥2) persons want to cu...