Beyond Cake Cutting: Allocating Homogeneous Divisible Goods

01/12/2022
by   Ioannis Caragiannis, et al.
0

The problem of fair division known as "cake cutting" has been the focus of multiple papers spanning several decades. The most prominent problem in this line of work has been to bound the query complexity of computing an envy-free outcome in the Robertson-Webb query model. However, the root of this problem's complexity is somewhat artificial: the agents' values are assumed to be additive across different pieces of the "cake" but infinitely complicated within each piece. This is unrealistic in most of the motivating examples, where the cake represents a finite collection of homogeneous goods. We address this issue by introducing a fair division model that more accurately captures these applications: the value that an agent gains from a given good depends only on the amount of the good they receive, yet it can be an arbitrary function of this amount, allowing the agents to express preferences that go beyond standard cake cutting. In this model, we study the query complexity of computing allocations that are not just envy-free, but also approximately Pareto optimal among all envy-free allocations. Using a novel flow-based approach, we show that we can encode the ex-post feasibility of randomized allocations via a polynomial number of constraints, which reduces our problem to solving a linear program.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/18/2022

Approximation Algorithms for Envy-Free Cake Division with Connected Pieces

Cake cutting is a classic model for studying fair division of a heteroge...
research
05/05/2020

Envy-free cake cutting: A polynomial number of queries with high probability

In this article we propose a probabilistic framework in order to study t...
research
07/01/2018

An Improved Envy-Free Cake Cutting Protocol for Four Agents

We consider the classic cake-cutting problem of producing envy-free allo...
research
11/09/2021

Cutting a Cake Is Not Always a "Piece of Cake": A Closer Look at the Foundations of Cake-Cutting Through the Lens of Measure Theory

Cake-cutting is a playful name for the fair division of a heterogeneous,...
research
04/18/2018

Truthful Fair Division without Free Disposal

We study the problem of fairly dividing a heterogeneous resource, common...
research
05/31/2020

Fair Cake Division Under Monotone Likelihood Ratios

This work develops algorithmic results for the classic cake-cutting prob...
research
09/16/2019

Disproportionate division

We study the disproportionate version of the classical cake-cutting prob...

Please sign up or login with your details

Forgot password? Click here to reset