Achieving EF1 and Epistemic EFX Guarantees Simultaneously
Hannaneh Akrami, Ryoga Mahara, Kurt Mehlhorn, Nidhi Rathi

TL;DR
This paper proves that for additive valuations, there always exists an allocation satisfying both EF1 and epistemic EFX fairness notions simultaneously, advancing the understanding of fair division of indivisible goods.
Contribution
The authors demonstrate the existence of allocations that satisfy both EF1 and EEFX for additive valuations, resolving a key open problem in fair division.
Findings
Existence of allocations satisfying EF1 and EEFX simultaneously.
Introduction of strong EEFX share as a new fairness notion.
Compatibility of strong EEFX share with EF1 leading to the main result.
Abstract
We study the fundamental problem of fairly dividing a set of indivisible goods among agents with additive valuations. Here, envy-freeness up to any good (EFX) is a central fairness notion and resolving its existence is regarded as one of the most important open problems in this area of research. Two prominent relaxations of EFX are envy-freeness up to one good (EF1) and epistemic EFX (EEFX). While allocations satisfying each of these notions individually are known to exist even for general monotone valuations, whether both can be satisfied simultaneously remains open for all instances in which the EFX problem is itself unresolved. In this work, we show that there always exists an allocation that is both EF1 (in fact, the stronger notion EFL) and EEFX for additive valuations, thereby resolving the primary open question raised by Akrami and Rathi (2025) and bringing us one step closer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Ethics and Social Impacts of AI · Auction Theory and Applications
