An Approximation Scheme for Cake Division with a Linear Number of Cuts

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F07%3A00096406" target="_blank" >RIV/67985840:_____/07:00096406 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

An Approximation Scheme for Cake Division with a Linear Number of Cuts

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 own measure. We prove the following result: For every .xi.>0, there exists a cake division scheme for n players that uses at most cxin cuts, and in which each player can enforce to get a share of at least (1-.xi.)/n of the cake according to his own private measure.

Czech name

Aproximační schéma pro dělení zdrojů s lineárním počtem řezů

Czech description

Článek prezentuje aproximační schéma pro dělení zdrojů s lineárním počtem řezů

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

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

2007

Confidentiality

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

Name of the periodical

Combinatorica

ISSN

0209-9683

e-ISSN

—

Volume of the periodical

27

Issue of the periodical within the volume

2

Country of publishing house

HU - HUNGARY

Number of pages

7

Pages from-to

205-211

UT code for WoS article

—

EID of the result in the Scopus database

—