Two Algorithms for Additive and Fair Division of Mixed Manna

07/08/2020
by   Martin Aleksandrov, et al.
0

We consider a fair division model in which agents have positive, zero and negative utilities for items. For this model, we analyse one existing fairness property - EFX - and three new and related properties - EFX_0, EFX^3 and EF1^3 - in combination with Pareto-optimality. With general utilities, we give a modified version of an existing algorithm for computing an EF1^3 allocation. With -α/0/α utilities, this algorithm returns an EFX^3 and PO allocation. With absolute identical utilities, we give a new algorithm for an EFX and PO allocation. With -α/0/β utilities, this algorithm also returns such an allocation. We report some new impossibility results as well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/23/2020

Jealousy-freeness and other common properties in Fair Division of Mixed Manna

We consider a fair division setting where indivisible items are allocate...
research
11/25/2019

Greedy Algorithms for Fair Division of Mixed Manna

We consider a multi-agent model for fair division of mixed manna (i.e. i...
research
11/16/2019

Fair Division of Mixed Divisible and Indivisible Goods

We study the problem of fair division when the resources contain both di...
research
07/27/2018

Fair allocation of combinations of indivisible goods and chores

We consider the problem of fairly dividing a set of items. Much of the f...
research
07/28/2018

Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods

In fair division of indivisible goods, using sequences of sincere choice...
research
06/06/2019

Fair Division Without Disparate Impact

We consider the problem of dividing items between individuals in a way t...
research
06/19/2020

Envy-freeness up to one item: Shall we add or remove resources?

We consider a fair division model in which agents have general valuation...

Please sign up or login with your details

Forgot password? Click here to reset