Communication Complexity of Discrete Fair Division

DOI10.1137/1.9781611975482.122zbMath1435.91109arXiv1711.04066OpenAlexW4253280466MaRDI QIDQ5236308

Tim Roughgarden, Benjamin Plaut

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

fair divisioncommunication complexityindivisible goods

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Communication complexity, information complexity (68Q11)

Related Items (4)

Almost Envy-Freeness with General Valuations ⋮ On the existence of Pareto efficient and envy-free allocations ⋮ Fairly Allocating Many Goods with Few Queries ⋮ The Price of Connectivity in Fair Division

This page was built for publication: Communication Complexity of Discrete Fair Division