TY - JOUR
T1 - Keep your distance
T2 - Land division with separation
AU - Elkind, Edith
AU - Segal-Halevi, Erel
AU - Suksompong, Warut
N1 - Publisher Copyright:
© 2023 The Author(s)
PY - 2023/8
Y1 - 2023/8
N2 - This paper is part of an ongoing endeavor to bring the theory of fair division closer to practice by handling requirements from real-life applications. We focus on two requirements originating from the division of land estates: (1) each agent should receive a plot of a usable geometric shape, and (2) plots of different agents must be physically separated. With these requirements, the classic fairness notion of proportionality is impractical, since it may be impossible to attain any multiplicative approximation of it. In contrast, the ordinal maximin share approximation, introduced by Budish in 2011, provides meaningful fairness guarantees. We prove upper and lower bounds on achievable maximin share guarantees when the usable shapes are squares, fat rectangles, or arbitrary axis-aligned rectangles, and explore the algorithmic and query complexity of finding fair partitions in this setting. Our work makes use of tools and concepts from computational geometry such as independent sets of rectangles and guillotine partitions.
AB - This paper is part of an ongoing endeavor to bring the theory of fair division closer to practice by handling requirements from real-life applications. We focus on two requirements originating from the division of land estates: (1) each agent should receive a plot of a usable geometric shape, and (2) plots of different agents must be physically separated. With these requirements, the classic fairness notion of proportionality is impractical, since it may be impossible to attain any multiplicative approximation of it. In contrast, the ordinal maximin share approximation, introduced by Budish in 2011, provides meaningful fairness guarantees. We prove upper and lower bounds on achievable maximin share guarantees when the usable shapes are squares, fat rectangles, or arbitrary axis-aligned rectangles, and explore the algorithmic and query complexity of finding fair partitions in this setting. Our work makes use of tools and concepts from computational geometry such as independent sets of rectangles and guillotine partitions.
KW - Fair division
KW - Guillotine partition
KW - Land division
KW - Maximin share
KW - Separation
UR - http://www.scopus.com/inward/record.url?scp=85150484631&partnerID=8YFLogxK
U2 - 10.1016/j.comgeo.2023.102006
DO - 10.1016/j.comgeo.2023.102006
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85150484631
SN - 0925-7721
VL - 113
JO - Computational Geometry: Theory and Applications
JF - Computational Geometry: Theory and Applications
M1 - 102006
ER -