Geodesic
Envy-free cake divisions cannot be found by finite protocols
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We show that no finite protocol (even if unbounded) can guarantee an envy-free division of a cake among three or more players, if each player is to receive a single connected piece.
DOI : 10.37236/735
Classification : 91B32, 68Q17, 05D05 
@article{10_37236_735,
     author = {Walter Stromquist},
     title = {Envy-free cake divisions cannot be found by finite protocols},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/735},
     zbl = {1158.91403},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/735/}
}
TY  - JOUR
AU  - Walter Stromquist
TI  - Envy-free cake divisions cannot be found by finite protocols
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/735/
DO  - 10.37236/735
ID  - 10_37236_735
ER  - 
%0 Journal Article
%A Walter Stromquist
%T Envy-free cake divisions cannot be found by finite protocols
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/735/
%R 10.37236/735
%F 10_37236_735
Walter Stromquist. Envy-free cake divisions cannot be found by finite protocols. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/735

Cité par Sources :