The complexity of cake cutting with unequal shares
From MaRDI portal
Publication:1617637
DOI10.1007/978-3-319-99660-8_3zbMath1415.91176arXiv1709.03152WikidataQ60308624 ScholiaQ60308624MaRDI QIDQ1617637
Publication date: 8 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.03152
68Q25: Analysis of algorithms and problem complexity
91B32: Resource and cost allocation (including fair division, apportionment, etc.)