Papers › Relaxations of Envy-Freeness Over Graphs
Relaxations of Envy-Freeness Over Graphs
Justin Payan, Rik Sengupta, Vignesh Viswanathan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
When allocating a set of indivisible items among agents, the ideal condition of envy-freeness cannot always be achieved. Envy-freeness up to any good (EFX), and envy-freeness with k hidden items (HEF-k) are two very compelling relaxations of envy-freeness, which remain elusive in many settings. We study a natural relaxation of these two fairness constraints, where we place the agents on the vertices of an undirected graph, and only require that our allocations satisfy the EFX (resp. HEF) constraint on the edges of the graph. We refer to these allocations as graph-EFX (resp. graph-HEF) or simply G-EFX (resp. G-HEF) allocations. We show that for any graph G, there always exists a G-HEF-k allocation of goods, where k is the size of a minimum vertex cover of G, and that this is essentially tight. We show that G-EFX allocations of goods exist for three different classes of graphs -- two of them generalizing the star K_(1, n-1) and the third generalizing the three-edge path P₄. Many of these results extend to allocations of chores as well. Overall, we show several natural settings in which the graph structure helps obtain strong fairness guarantees. Finally, we evaluate an algorithm using problem instances from Spliddit to show that G-EFX allocations appear to exist for paths Pₙ, pointing the way towards showing EFX for even broader families of graphs.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections