DeepAI AI Chat
Log In Sign Up

Achieving Envy-freeness and Equitability with Monetary Transfers

03/18/2020
by   Haris Aziz, et al.
UNSW
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

12/05/2019

One Dollar Each Eliminates Envy

We study the fair division of a collection of m indivisible goods amongs...
11/02/2022

Fair Allocation of Two Types of Chores

We consider the problem of fair allocation of indivisible chores under a...
11/05/2018

When Do Envy-Free Allocations Exist?

We consider a fair division setting in which m indivisible items are to ...
05/11/2021

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

We consider the problem of dividing limited resources to individuals arr...
11/29/2022

On the Envy-free Allocation of Chores

We study the problem of allocating a set of indivisible chores to three ...
02/28/2022

An EF2X Allocation Protocol for Restricted Additive Valuations

We study the problem of fairly allocating a set of m indivisible goods t...
11/10/2020

Inferring Symbolic Automata

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