EFX Allocations Exist for Binary Valuations

We study the fair division problem and the existence of allocations satisfying the fairness criterion envy-freeness up to any item (EFX). The existence of EFX allocations is a major open problem in the fair division literature. We consider binary valuations where the marginal gain of the value by re...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2023-08
Main Authors: Bu, Xiaolin, Song, Jiaxin, Yu, Ziqi
Format: Article
Language:English
Subjects:
Algorithms
Allocations
Polynomials
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the fair division problem and the existence of allocations satisfying the fairness criterion envy-freeness up to any item (EFX). The existence of EFX allocations is a major open problem in the fair division literature. We consider binary valuations where the marginal gain of the value by receiving an extra item is either \(0\) or \(1\). Babaioff et al. [2021] proved that EFX allocations always exist for binary and submodular valuations. In this paper, by using completely different techniques, we extend this existence result to general binary valuations that are not necessarily submodular, and we present a polynomial time algorithm for computing an EFX allocation.
ISSN:2331-8422