Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal
Autonomous Agents and Multi-Agent Systems, pp. 901-908, 2016.
Cake-cuttingenvy-freefair divisionfinite algorithmperfect matching
We consider the classic problem of envy-free division of a heterogeneous good (“cake”) among several agents. It is known that, when the allotted pieces must be connected, the problem cannot be solved by a finite algorithm for three or more agents. The impossibility result, however, assumes that the entire cake must be allocated. In this a...More
Full Text (Upload PDF)
PPT (Upload PPT)