Achieving Envy-freeness and Equitability with Monetary Transfers

03/18/2020
by   Haris Aziz, et al.
0

When allocating indivisible resources or tasks, an envy-free allocation or equitable allocation may not exist. We present a sufficient condition and an algorithm to achieve envy-freeness and equitability when monetary transfers are allowed. The approach works for any agent valuation functions (positive or negative) as long as they satisfy superadditivity. For the case of additive utilities, we present a characterization of allocations that can simultaneously be made equitable and envy-free via payments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2019

One Dollar Each Eliminates Envy

We study the fair division of a collection of m indivisible goods amongs...
research
08/29/2023

Efficient Almost-Egalitarian Allocation of Goods and Bads

We consider the allocation of indivisible objects among agents with diff...
research
07/18/2023

On the Existence of Envy-Free Allocations Beyond Additive Valuations

We study the problem of fairly allocating m indivisible items among n ag...
research
11/05/2018

When Do Envy-Free Allocations Exist?

We consider a fair division setting in which m indivisible items are to ...
research
09/15/2023

Fairly Allocating Goods in Parallel

We initiate the study of parallel algorithms for fairly allocating indiv...
research
05/11/2021

Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Tradeoff Curve

We consider the problem of dividing limited resources to individuals arr...
research
11/10/2020

Inferring Symbolic Automata

We study the learnability of symbolic finite state automata, a model sho...

Please sign up or login with your details

Forgot password? Click here to reset