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

06/19/2020
by   Martin Aleksandrov, et al.
0

We consider a fair division model in which agents have general valuations for bundles of indivisible items. We propose two new axiomatic properties for allocations in this model: EF1+- and EFX+-. We compare these with the existing EF1 and EFX. Although EF1 and EF1+- allocations often exist, our results assert eloquently that EFX+- and PO allocations exist in each case where EFX and PO allocations do not exist. Additionally, we prove several new impossibility and incompatibility results.

READ FULL TEXT
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
06/29/2020

Monotone and Online Fair Division

We study a new but simple model for online fair division in which indivi...
research
12/10/2021

EEF1-NN: Efficient and EF1 allocations through Neural Networks

Neural networks have shown state-of-the-art performance in designing auc...
research
06/29/2020

Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items

We study the fair division of items to agents supposing that agents can ...
research
07/08/2020

Two Algorithms for Additive and Fair Division of Mixed Manna

We consider a fair division model in which agents have positive, zero an...
research
08/10/2023

EFX Allocations Exist for Binary Valuations

We study the fair division problem and the existence of allocations sati...
research
06/28/2019

Cake cutting: Explicit examples for impossibility results

In this article we suggest a model of computation for the cake cutting p...

Please sign up or login with your details

Forgot password? Click here to reset