A note on envy-free cake division

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10333652" target="_blank" >RIV/00216208:11320/16:10333652 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

A note on envy-free cake division

Popis výsledku v původním jazyce

This note deals with fair division problems; in particular, with cake-cutting procedures that result in an envy-free division. Despite intense eorts in the last decades, it seems that it is still an open question whether there is a nite bounded envy-free cake-cutting procedure for n players with n > 3. However, quite recently, some authors have claimed to have solved the problem both for four players and for any nite number of players. The purpose of this note is to discuss recent work in this area and to point out several errors and confusion about some assumptions.

Název v anglickém jazyce

A note on envy-free cake division

Popis výsledku anglicky

This note deals with fair division problems; in particular, with cake-cutting procedures that result in an envy-free division. Despite intense eorts in the last decades, it seems that it is still an open question whether there is a nite bounded envy-free cake-cutting procedure for n players with n > 3. However, quite recently, some authors have claimed to have solved the problem both for four players and for any nite number of players. The purpose of this note is to discuss recent work in this area and to point out several errors and confusion about some assumptions.

Druh

O - Ostatní výsledky

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2016

Kód důvěrnosti údajů

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