Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm

DOI10.1137/080729475zbMath1231.91045OpenAlexW2082789254MaRDI QIDQ3115855

Steven J. Brams, Christian Klamler, Michael A. Jones

Publication date: 11 February 2012

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://mpra.ub.uni-muenchen.de/22704/1/MPRA_paper_22704.pdf

zbMATH Keywords

binary treefair divisioncake-cuttingminimal envyproportional algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to game theory, economics, and finance (91-08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Combinatorial games (91A46)

Related Items (6)

Distributed fair allocation of indivisible goods ⋮ Fair cake-cutting in practice ⋮ Two-person cake cutting: the optimal number of cuts ⋮ Fair Division ⋮ Cake-cutting with different entitlements: how many cuts are needed? ⋮ How to share a cake with a secret agent

This page was built for publication: Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm