Chore Cutting: Envy and Truth

We study the fair division of divisible bad resources with strategic agents who can manipulate their private information to get a better allocation. Within certain constraints, we are particularly interested in whether truthful envy-free mechanisms exist over piecewise-constant valuations. We demonstrate that no deterministic truthful envy-free mechanism can exist in the connected-piece scenario, and the same impossibility result occurs for hungry agents. We also show that no deterministic, truthful dictatorship mechanism can satisfy the envy-free criterion, and the same result remains true for non-wasteful constraints rather than dictatorship. We further address several related problems and directions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2021

On Existence of Truthful Fair Cake Cutting Mechanisms

We study the fair division problem on divisible heterogeneous resources ...
research
04/18/2018

Truthful Fair Division without Free Disposal

We study the problem of fairly dividing a heterogeneous resource, common...
research
06/03/2023

Getting More by Knowing Less: Bayesian Incentive Compatible Mechanisms for Fair Division

We study fair resource allocation with strategic agents. It is well-know...
research
05/16/2023

Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods

We study the problem of designing truthful and fair mechanisms when allo...
research
12/10/2021

Truthful Cake Sharing

The classic cake cutting problem concerns the fair allocation of a heter...
research
04/10/2023

Cutting the Cake: A Language for Fair Division

The fair division literature in economics considers how to divide resour...
research
02/07/2020

A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget

The current practice of envy-free rent division, lead by the fair alloca...

Please sign up or login with your details

Forgot password? Click here to reset