Original title: KAM-DIMATIA Series 2004-688 and ITI Series 2004-208. On the complexity of cake cutting
Translated title: O složitosti dělení dortů
Authors: Sgall, Jiří ; Woeginger, G. J.
Document type: Research reports
Year: 2004
Language: eng
Abstract: [eng] [cze]
In the cake cutting problem, $n/ge2$ players want to cut a cake into $n$ pieces so that every player gets a ďfairď share of the cake by his own measure. One positive and one negative results are given. Článek studuje složitost dělení dortů.
Keywords: concrete complexity; fair division
Project no.: CEZ:AV0Z1019905 (CEP), LN00A056 (CEP), IAA1019401 (CEP)
Funding provider: GA MŠk, GA AV ČR

Institution: Institute of Mathematics AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0014097

Permalink: http://www.nusl.cz/ntk/nusl-20191


The record appears in these collections:
Research > Institutes ASCR > Institute of Mathematics
Reports > Research reports