Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal

Autonomous Agents and Multi-Agent Systems, pp. 901-908, 2016.

Cited by: 14|Bibtex|Views6|
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com
Keywords:
Cake-cuttingenvy-freefair divisionfinite algorithmperfect matching

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments