How to cut a cake fairly using a minimal number of cuts
type: Item
instance of: scholarly article
title: How to cut a cake fairly using a minimal number of cuts
zbMATH Open document ID: 0876.90100
DOI: 10.1016/S0166-218X(96)00032-7
author: William A. Webb
published in: Discrete Applied Mathematics
publication date: 1997-06-09T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 1018595
zbMATH Keywords: cake cutting
zbMATH Keywords: fair division
zbMATH Keywords: minimum number of cuts
MaRDI profile type: Publication
cites work: Constructing a Fair Border
cites work: The equivalence- singularity problem for Gaussian signals in Gaussian noise (Corresp.)
cites work: An Envy-Free Cake Division Protocol
cites work: On envy-free cake division
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: A Note on the Fair Division Problem
cites work: Determining a Fair Border
cites work: Ramsey partitions of integers and fair divisions
cites work: Q3981356
cites work: Approximating fair division with a limited number of cuts
cites work: Sur la division pragmatique
cites work: How to Cut a Cake Fairly
cites work: A combinatorial algorithm to establish a fair border
cites work: Dividing a cake fairly
cites work: A note on the cake-division problem
description: scientific article; zbMATH DE number 1018595