A near equitable 2-person cake cutting algorithm

DOI10.1080/02331934.2011.563306zbMath1295.91057OpenAlexW1977201612MaRDI QIDQ3145047

Eva Pillárová, Katarína Cechlárova

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)

Related Items (2)

On a method of obtaining exact fair divisions ⋮ Resource-monotonicity and population-monotonicity in connected cake-cutting

Cites Work

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

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