The complexity of cake cutting with unequal shares

DOI10.1007/978-3-319-99660-8_3zbMath1415.91176arXiv1709.03152OpenAlexW3126585113WikidataQ60308624 ScholiaQ60308624MaRDI QIDQ1617637

Ágnes Cseh, Tamás Fleiner

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

zbMATH Keywords

fair divisioncake cuttingproportional divisionfair division of goodsunequal shares

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (8)

Cutting a cake for infinitely many guests ⋮ Fair cake-cutting for imitative agents ⋮ Keep your distance: land division with separation ⋮ Disproportionate division ⋮ Fair cake-cutting among families ⋮ Picking sequences and monotonicity in weighted fair division ⋮ Cake-cutting with different entitlements: how many cuts are needed? ⋮ Mind the gap: cake cutting with separation

This page was built for publication: The complexity of cake cutting with unequal shares