Fair Cake Division Under Monotone Likelihood Ratios

05/31/2020
by   Siddharth Barman, et al.
0

This work develops algorithmic results for the classic cake-cutting problem in which a divisible, heterogeneous resource (modeled as a cake) needs to be partitioned among agents with distinct preferences. We focus on a standard formulation of cake cutting wherein each agent must receive a contiguous piece of the cake. While multiple hardness results exist in this setup for finding fair/efficient cake divisions, we show that, if the value densities of the agents satisfy the monotone likelihood ratio property (MLRP), then strong algorithmic results hold for various notions of fairness and economic efficiency. Addressing cake-cutting instances with MLRP, first we develop an algorithm that finds cake divisions (with connected pieces) that are envy-free, up to an arbitrary precision. The time complexity of our algorithm is polynomial in the number of agents and the bit complexity of an underlying Lipschitz constant. We obtain similar positive results for maximizing social (utilitarian) and egalitarian welfare. In addition, we show that, under MLRP, the problem of maximizing Nash social welfare admits a fully polynomial-time approximation scheme (FPTAS). Many distribution families bear MLRP. In particular, this property holds if all the value densities belong to any one of the following families: Gaussian (with the same variance), linear, binomial, Poisson, and exponential distributions. Furthermore, it is known that linear translations of any log-concave function satisfy MLRP. Therefore, our results also hold when the value densities of the agents are linear translations of the following (log-concave) distributions: Laplace, gamma, beta, Subbotin, chi-square, Dirichlet, and logistic. Hence, through MLRP, the current work obtains novel cake-cutting algorithms for multiple distribution families.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2019

Fair and Efficient Cake Division with Connected Pieces

The classic cake-cutting problem provides a model for addressing fair an...
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/28/2022

On the Complexity of Maximizing Social Welfare within Fair Allocations of Indivisible Goods

Fair division is a classical topic studied in various disciplines and ca...
research
11/29/2021

Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits

The classic cake-cutting problem provides a model for addressing the fai...
research
01/12/2022

Beyond Cake Cutting: Allocating Homogeneous Divisible Goods

The problem of fair division known as "cake cutting" has been the focus ...
research
08/01/2020

Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores

We study the chore division problem where a set of agents needs to divid...
research
01/25/2018

The Price of Indivisibility in Cake Cutting

We consider the problem of envy-free cake cutting, which is the distribu...

Please sign up or login with your details

Forgot password? Click here to reset