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 axes-aligned rectangles, and explore the algorithmic and query complexity of finding fair partitions in this setting.
|Title of host publication
|Proceedings of the 30th International Joint Conference on Artificial Intelligence, IJCAI 2021
|International Joint Conferences on Artificial Intelligence
|Number of pages
|Published - 2021
|30th International Joint Conference on Artificial Intelligence, IJCAI 2021 - Virtual, Online, Canada
Duration: 19 Aug 2021 → 27 Aug 2021
|IJCAI International Joint Conference on Artificial Intelligence
|30th International Joint Conference on Artificial Intelligence, IJCAI 2021
|19/08/21 → 27/08/21
Bibliographical notePublisher Copyright:
© 2021 International Joint Conferences on Artificial Intelligence. All rights reserved.