A lower bound for cake cutting.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F03%3A05030096" target="_blank" >RIV/67985840:_____/03:05030096 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

A lower bound for cake cutting.

Original language description

We prove that in a certain cake cutting model, every fair cake division protocol for $n$ players must use $ Omega (nlog n) $. Up to a small constant factor, our lower bound matches a corresponding upper bound in the same model by Even & Paz from 1984.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

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)

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the 11th Annual European Symposium on Algorithms.

ISBN

—

ISSN

—

e-ISSN

—

Number of pages

11

Pages from-to

459-469

Publisher name

Springer

Place of publication

Berlin

Event location

Budapest [HU]

Event date

Sep 15, 2003

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—