6 papers
Polynomial Algorithms for Simultaneous Share-Based and Envy-Based Guarantees
Hannaneh Akrami, Arash Ashuri, Kurt Mehlhorn
We study the simultaneous achievement of share-based and envy-based fairness in the allocation of indivisible goods with nonnegative additive valuations. The AnyPrice share (APS) i…
A Simple Polynomial-Time EFX Repair for Cancelable Valuations
Hannaneh Akrami, Arash Ashuri, Bhaskar Ray Chaudhury +2
The leximin++ proof of Plaut and Roughgarden for agents with identical monotone valuations gives a natural EFX-repair procedure: starting from an arbitrary partition, repeatedly tr…
EFX Allocations Exist on Multi-Graphs
Mahyar Afshinmehr, Arash Ashuri, Pouria Mahmoudkhan +2
We study the fair allocation of indivisible goods among agents, with a focus on limiting envy. A central fairness notion is envy-freeness up to any good (EFX), which requires that…
EFX Allocations Exist on Triangle-Free Multi-Graphs
Mahyar Afshinmehr, Arash Ashuri, Pouria Mahmoudkhan +1
We study the fair allocation of indivisible goods among agents, with a focus on limiting envy. A central open question in this area is the existence of EFX allocations-allocations…
Simultaneously Satisfying MXS and EFL
Arash Ashuri, Vasilis Gkatzelis
The two standard fairness notions in the resource allocation literature are proportionality and envy-freeness. If there are n agents competing for the available resources, then pro…
EF2X Exists For Four Agents
Arash Ashuri, Vasilis Gkatzelis, Alkmini Sgouritsa
We study the fair allocation of indivisible goods among a group of agents, aiming to limit the envy between any two agents. The central open problem in this literature, which has p…