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

Cited by: 19|Bibtex|Views1
Other Links: arxiv.org

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 3 or more agents. Even when the pieces may be disconnected, no bounded-time algorithm is known for 5 or more age...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments