EFX Allocations on Graphs

George Christodoulou, Amos Fiat, Elias Koutsoupias, Alkmini Sgouritsa

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study envy freeness up to any good (EFX) in settings where valuations can be represented via a graph of arbitrary size where vertices correspond to agents and edges to items. An item (edge) has zero marginal value to all agents (vertices) not incident to the edge. Each vertex may have an arbitrary monotone valuation on the set of incident edges. We first consider allocations that correspond to orientations of the edges, where we show that EFX does not always exist, and furthermore that it is NP-complete to decide whether an EFX orientation exists. Our main result is that (EFX) allocations exist for this setting. This is one of the few cases where EFX allocations are known to exist for more than 3 agents.

Original languageEnglish
Title of host publicationEC 2023 - Proceedings of the 24th ACM Conference on Economics and Computation
PublisherAssociation for Computing Machinery, Inc
Pages473-488
Number of pages16
ISBN (Electronic)9798400701047
DOIs
StatePublished - 9 Jul 2023
Event24th ACM Conference on Economics and Computation, EC 2023 - London, United Kingdom
Duration: 9 Jul 202312 Jul 2023

Publication series

NameEC 2023 - Proceedings of the 24th ACM Conference on Economics and Computation

Conference

Conference24th ACM Conference on Economics and Computation, EC 2023
Country/TerritoryUnited Kingdom
CityLondon
Period9/07/2312/07/23

Keywords

  • EFX allocations
  • discrete fair division

Fingerprint

Dive into the research topics of 'EFX Allocations on Graphs'. Together they form a unique fingerprint.

Cite this