Envy-free cake divisions cannot be found by finite protocols
type: Item
instance of: scholarly article
title: Envy-free cake divisions cannot be found by finite protocols
zbMATH Open document ID: 1158.91403
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/129749
full work available at URL: v15i1r11.html
review text: Summary: We show that no finite protocol (even if unbounded) can guarantee an envy-free division of a cake among three or more players, if each player is to receive a single connected piece.
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05D05
zbMATH DE Number: 5540916
author: Walter Stromquist
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5540916