1 citations · 1 across the 1 of their papers we have counts for
1 paper
Hiro Ito, Takahiro Ueda
In this paper, we show algorithms for solving the cake-cutting problem in sublinear-time. More specifically, we preassign (simple) fair portions to o(n) players in o(n)-time, and m…