On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources

DOI10.4230/lipics.approx/random.2021.1arXiv2012.06788OpenAlexW3204939179MaRDI QIDQ6070370

Rohit Vaish, Unnamed Author, Umang Bhaskar

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2012.06788

zbMATH Keywords

fair divisionapproximate envy-freenessindivisible chores

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (4)

Almost envy-freeness for groups: improved bounds via discrepancy theory ⋮ Repeatedly matching items to agents fairly and efficiently ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ Approximately EFX allocations for indivisible chores

This page was built for publication: On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources