2021/10/07 by Pablo Soberón, Soberón, Pablo · 1 citation
Economics, Econometrics and Finance · #91B32 #Combinatorics (math.CO) #Computer Science and Game Theory (cs.GT) #Economic theories and models #FOS: Computer and information sciences #FOS: Mathematics #Game Theory and Voting Systems
paper · pdf · doi:10.48550/arxiv.2110.03600
openalex publication_date 2021/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.