Aug 18, 2022 · We develop approximation algorithms for finding envy-free (fair) cake divisions. In particular, this work improves the state-of-the-art additive approximation ...
Addressing cake division under a typical requirement that each agent must receive a connected piece of the cake, we develop approximation algorithms for finding ...
Apr 27, 2023 · Cake cutting is a classic model for studying fair division of a heterogeneous, divisible re- source among agents with individual preferences.
Addressing cake division under a typical requirement that each agent must receive a connected piece of the cake, we develop approximation algorithms for finding ...
An envy-free cake-cutting is a kind of fair cake-cutting. It is a division of a heterogeneous resource ("cake") that satisfies the envy-free criterion.
Early work in cake cutting established that a proportional and envy-free allocation that assigns to each agent a connected piece of cake always exists, ...
It is shown that the envy-free cake-cutting problem has the same complexity as finding a Brouwer's fixed point, or, more formally, it is PPAD-complete.
Cake-cutting means dividing a resource that is heterogeneous and continuous, such as a birthday cake. The resource is usually represented by a real interval ...
In fact, Stromquist [Str08] has shown that there does not exist a finite-time algorithm for finding envy-free cake divisions with connected pieces; this result ...
The cake-cutting setting, in which a single heterogeneous good must be divided between multiple parties with different tastes, is a classic model for ...