Extensions of cut-and-choose fair division (Q677613): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Splitting necklaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Envy-Free Cake Division Protocol / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How to Cut A Cake Fairly / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on cake cutting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Note on the Fair Division Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ramsey partitions of integers and fair divisions / rank | |||
Normal rank |
Latest revision as of 12:05, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extensions of cut-and-choose fair division |
scientific article |
Statements
Extensions of cut-and-choose fair division (English)
0 references
13 April 1997
0 references
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.
0 references
fair division
0 references
cut-and-choose steps
0 references