Benjamin Plaut, Tim Roughgarden. Communication Complexity of Discrete Fair Division. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 2014-2033, SIAM, 2019. [doi]
Abstract is missing.