Extensions of cut-and-choose fair division
type: Item
instance of: scholarly article
title: Extensions of cut-and-choose fair division
zbMATH Open document ID: 0876.90108
author: Jack M. Robertson
author: William A. Webb
published in: Elemente der Mathematik
publication date: 1997-04-13T00:00:00Z
review text: The ancient method of ``one cuts the other chooses'' for fair division has the attractive property that the noncutter has simply to chose a preferred piece. Here it is shown that a cake can be fairly divided between two players in any ratio using a (possibly infinite) sequence of such simple cut-and-choose steps requiring only a preference decision. The method is extended to any number of players and requirements for needing only finitely many cuts are discussed. Also, a modified method is given which always uses only a finite number of cuts and moreover appears to be quite efficient in terms of number of cuts used.
Mathematics Subject Classification ID: 91A20
Mathematics Subject Classification ID: 91B52
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 91B08
zbMATH DE Number: 998494
zbMATH Keywords: fair division
zbMATH Keywords: cut-and-choose steps
MaRDI profile type: Publication
full work available at URL: s000170050007
OpenAlex ID: W2063437772
cites work: Splitting necklaces
cites work: An Envy-Free Cake Division Protocol
cites work: How to Cut A Cake Fairly
cites work: A note on cake cutting
cites work: A Note on the Fair Division Problem
cites work: Ramsey partitions of integers and fair divisions
DOI: 10.1007/S000170050007
description: scientific article; zbMATH DE number 998494