Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
From MaRDI portal
Publication:1763188
DOI10.1016/j.mathsocsci.2004.03.006zbMath1080.91017OpenAlexW1982793856MaRDI QIDQ1763188
Steven J. Brams, Julius B. Barbanel
Publication date: 22 February 2005
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2004.03.006
Related Items (17)
Fair and square: cake-cutting in two dimensions ⋮ Three Persons, Two Cuts: A New Cake-Cutting Algorithm ⋮ Fair multi-cake cutting ⋮ Children crying at birthday parties. Why? ⋮ Efficient Fair Division with Minimal Sharing ⋮ Fair division of graphs and of tangled cakes ⋮ Two-person cake cutting: the optimal number of cuts ⋮ Expand the shares together: envy-free mechanisms with a small number of cuts ⋮ Fair Division ⋮ Strategic divide and choose ⋮ Proportional pie-cutting ⋮ Unnamed Item ⋮ Envy-free division of discrete cakes ⋮ Fair cake-cutting among families ⋮ Envy-Free Division of Land ⋮ Envy-free division of discrete cakes ⋮ Almost envy-free allocations with connected bundles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on cake cutting
- Dividing a cake fairly
- Old and new moving-knife schemes
- Equitable allocation of divisible goods
- Rental Harmony: Sperner's Lemma in Fair Division
- On Envy-Free Cake Division
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
- A moving-knife solution to the four-person envy-free cake-division problem
- Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods
- Four-Person Envy-Free Chore Division
- An Envy-Free Cake Division Protocol
This page was built for publication: Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
