Three Persons, Two Cuts: A New Cake-Cutting Algorithm
From MaRDI portal
Publication:5074213
DOI10.1080/0025570X.2022.2023300OpenAlexW4210489919MaRDI QIDQ5074213
Steven J. Brams, Peter S. Landweber
Publication date: 9 May 2022
Published in: Mathematics Magazine (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0025570x.2022.2023300
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on envy-free cake cutting with polynomial valuations
- Envy-free cake divisions cannot be found by finite protocols
- An improved envy-free cake cutting protocol for four agents
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Cake cutting: explicit examples for impossibility results
- The Stadtgottesacker in Halle
- Rental Harmony: Sperner's Lemma in Fair Division
- How to Cut a Cake Fairly
- A moving-knife solution to the four-person envy-free cake-division problem
- Fair Enough
- Which Is the Fairest (Rent Division) of Them All?
- An Envy-Free Cake Division Protocol
This page was built for publication: Three Persons, Two Cuts: A New Cake-Cutting Algorithm
