A near equitable 2-person cake cutting algorithm

DOI10.1080/02331934.2011.563306MaRDI QIDQ3145047zbMATH OpenOpenAlexFDO

Authors Katarina Cechlárová, Eva Pillárová

Publication date 13 December 2012

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2011.563306

zbMATH Keywords

algorithmapproximationcake cutting

Mathematics Subject Classification ID

2-person games (91A05) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• On the computability of equitable divisions
• Three persons, two cuts: a new cake-cutting algorithm
• On the existence of equitable cake divisions
• Algorithms for cake cutting with equal and unequal shares
• Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm

Cites work

• Consensus-halving via theorems of Borsuk-Ulam and Tucker
• Game theoretic analysis of a bankruptcy problem from the Talmud
• How to Cut a Cake Fairly
• Old and new moving-knife schemes
• On the complexity of cake cutting

Cited in

(8)

• Resource-monotonicity and population-monotonicity in connected cake-cutting
• Fair and square: cake-cutting in two dimensions
• On the existence of equitable cake divisions
• Two-Person Pie-Cutting: The Fairest Cuts
• Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
• Three persons, two cuts: a new cake-cutting algorithm
• On a method of obtaining an approximate solution of an exact fair division problem
• Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

This page was built for publication: A near equitable 2-person cake cutting algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145047)