Fair distributions for more participants than allocations

Autor:	Soberón, Pablo
Rok vydání:	2021
Předmět:	Computer Science - Computer Science and Game Theory Mathematics - Combinatorics 91B32
Druh dokumentu:	Working Paper
Popis:	We study the existence of fair distributions when we have more guests than pieces to allocate, focusing on envy-free distributions among those who receive a piece. The conditions on the demand from the guests can be weakened from those of classic cake-cutting and rent-splitting results of Stromquist, Woodall, and Su. We extend existing variations of the cake-cutting problem with secretive guests and those that resist the removal of any sufficiently small set of guests. Comment: 10 pages, 2 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2110.03600 Zobrazit plný text záznamu View this record from Arxiv