On the number of almost envy-free allocations

DOI10.1016/j.dam.2020.03.039zbMath1444.91109arXiv2006.00178OpenAlexW3015881104MaRDI QIDQ777445

Warut Suksompong

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

resource allocationenvy-freeness

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (5)

Maximum Nash welfare and other stories about EFX ⋮ Diverse fair allocations: complexity and algorithms ⋮ The price of fairness for indivisible goods ⋮ Closing Gaps in Asymptotic Fair Division ⋮ Fairly Allocating Many Goods with Few Queries

Cites Work

• Envy-freeness in house allocation problems
• Fairly allocating contiguous blocks of indivisible items
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of almost envy-free allocations