Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
type: Item
instance of: scholarly article
title: Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
zbMATH Open document ID: 1080.91017
author: Julius B. Barbanel
author: Steven J. Brams
published in: Mathematical Social Sciences
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 91A18
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2136100
zbMATH Keywords: Cake-cutting
zbMATH Keywords: Fair division
zbMATH Keywords: Envy-freeness
zbMATH Keywords: Moving-knife algorithm
zbMATH Keywords: Minimal cuts
MaRDI profile type: Publication
full work available at URL: j.mathsocsci.2004.03.006
OpenAlex ID: W1982793856
cites work: An Envy-Free Cake Division Protocol
cites work: Q4338900
cites work: Old and new moving-knife schemes
cites work: A moving-knife solution to the four-person envy-free cake-division problem
cites work: How to Cut A Cake Fairly
cites work: A note on cake cutting
cites work: Equitable allocation of divisible goods
cites work: Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods
cites work: Four-Person Envy-Free Chore Division
cites work: On Envy-Free Cake Division
cites work: Q4940018
cites work: Q4221107
cites work: How to Cut a Cake Fairly
cites work: Rental Harmony: Sperner's Lemma in Fair Division
cites work: Dividing a cake fairly
cites work: Approximate envy-free procedures
DOI: 10.1016/J.MATHSOCSCI.2004.03.006
description: scientific article; zbMATH DE number 2136100