Robertson–Webb envy-free cake-cutting algorithm
The Robertson-Webb protocol is a protocol for envy-free cake-cutting. Its input is a "cake" (a heterogeneous resource) and n partners with different preferences over different portions of the cake. Its output is a division of the cake to n disjoint subsets, each subset possibly containing a large number of disconnected pieces, such that each partner believes that his subset is at least as good as the other subsets. The protocol uses a finite number of queries to the partners, but, the number of queries is unbounded.
The protocol was first published in 1997[1] and later in 1998.[2]
- ^ Robertson, Jack M.; Webb, William A. (1997). "Near exact and envy free cake division". Ars Combinatoria. 45: 97–108.
- ^ Template:Cite isbn