Keep your distance: Land division with separation

被引:2
作者
Elkind, Edith [1 ]
Segal-Halevi, Erel [2 ]
Suksompong, Warut [3 ]
机构
[1] Univ Oxford, Dept Comp Sci, Oxford, England
[2] Ariel Univ, Dept Comp Sci, Ariel, Israel
[3] Natl Univ Singapore, Sch Comp, Singapore, Singapore
来源
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2023年 / 113卷
基金
欧洲研究理事会; 以色列科学基金会;
关键词
Land division; Guillotine partition; Maximin share; Separation; Fair division; MAXIMUM INDEPENDENT SET; GUILLOTINE PARTITIONS; CUT; EQUILIBRIUM; ALLOCATION;
D O I
10.1016/j.comgeo.2023.102006
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 proportionalityis 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. (C) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页数:21
相关论文
共 62 条
  • [1] Abed Fidaa, 2015, P 18 INT WORKSHOP AP, P1
  • [2] The number of guillotine partitions in d dimensions
    Ackerman, E
    Barequet, G
    Pinter, RY
    Romik, D
    [J]. INFORMATION PROCESSING LETTERS, 2006, 98 (04) : 162 - 167
  • [3] Approximation Schemes for Maximum Weight Independent Set of Rectangles
    Adamaszek, Anna
    Wiese, Andreas
    [J]. 2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 400 - 409
  • [4] Label placement by maximum independent set in rectangles
    Agarwal, PK
    van Kreveld, M
    Suri, S
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 11 (3-4): : 209 - 218
  • [5] COMPUTING DEPTH ORDERS FOR FAT OBJECTS AND RELATED PROBLEMS
    AGARWAL, PK
    KATZ, MJ
    SHARIR, M
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1995, 5 (04): : 187 - 206
  • [6] Aharoni R, 2019, Arxiv, DOI arXiv:1909.13143
  • [7] Algorithms for fair partitioning of convex polygons
    Armaselu, Bogdan
    Daescu, Ovidiu
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 607 : 351 - 362
  • [8] Cut equivalence of d-dimensional guillotine partitions
    Asinowski, Andrei
    Barequet, Gill
    Mansour, Toufik
    Pinter, Ron Y.
    [J]. DISCRETE MATHEMATICS, 2014, 331 : 165 - 174
  • [9] THE PRICE OF CONNECTIVITY IN FAIR DIVISION
    Bei, Xiaohui
    Igarashi, Ayumi
    Lu, Xinhang
    Suksompong, Warut
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (02) : 1156 - 1186
  • [10] Bei XH, 2021, AAAI CONF ARTIF INTE, V35, P5151