On the complexity of cake cutting
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F07%3A00096351" target="_blank" >RIV/67985840:_____/07:00096351 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the complexity of cake cutting
Original language description
In the cake cutting problem, n>2 players want to cut a cake into n pieces so that every player gets a ´fair´ share of the cake by his/her own measure. We prove that in a certain, natural cake cutting model, every fair cake division protocol for n playersmust use .OMEGA.(nlogn) cuts and evaluation queries in the worst case. Up to small constant factor, this lower bound matches a corresponding upper bound in the same model obtained by Even and Paz, from 1984
Czech name
O složitosti dělení zdrojů
Czech description
Článek prezentuje dolní odhad na počet řezů při dělení zdrojů
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Optimization
ISSN
1572-5286
e-ISSN
—
Volume of the periodical
4
Issue of the periodical within the volume
2
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
8
Pages from-to
213-220
UT code for WoS article
—
EID of the result in the Scopus database
—