Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence 2020
DOI: 10.24963/ijcai.2020/26
|View full text |Cite
|
Sign up to set email alerts
|

Fair Division of Time: Multi-layered Cake Cutting

Abstract: We initiate the study of multi-layered cake cutting with the goal of fairly allocating multiple divisible resources (layers of a cake) among a set of agents. The key requirement is that each agent can only utilize a single resource at each time interval. Several real-life applications exhibit such restrictions on overlapping pieces, for example, assigning time intervals over multiple facilities and resources or assigning shifts to medical professionals. We investigate the existence and computation of e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

1
12
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(13 citation statements)
references
References 5 publications
1
12
0
Order By: Relevance
“…With this new technique, the existence of an envy-free multi-division is shown for a general class of preferences that are not necessarily monotone. Our existence result concerning envy-freeness also answers another open question raised by Hosseini et al: It implies the existence of a proportional multi-division that is feasible and contiguous when m n, m is a prime power, and agents have non-negative additive valuations, and thus properly generalizes the known existence result when m is a power of 2 and m n [9]; see Section 5 for details.…”
Section: Introductionsupporting
confidence: 79%
See 3 more Smart Citations
“…With this new technique, the existence of an envy-free multi-division is shown for a general class of preferences that are not necessarily monotone. Our existence result concerning envy-freeness also answers another open question raised by Hosseini et al: It implies the existence of a proportional multi-division that is feasible and contiguous when m n, m is a prime power, and agents have non-negative additive valuations, and thus properly generalizes the known existence result when m is a power of 2 and m n [9]; see Section 5 for details.…”
Section: Introductionsupporting
confidence: 79%
“…Indeed, if we merely divide the m time intervals independently, this may result in a division that is not feasible, i.e., it may assign overlapping time intervals to the same agent who can utilize at most one room at a given time. In order to capture such constraints, Hosseini, Igarashi, and Searns [9] have recently introduced the multi-layered cake-cutting problem. There, n agents divide m different cakes under the feasibility constraint: the pieces of different layers assigned to the same agent should be non-overlapping, i.e., these pieces should have disjoint interiors.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…The cake serves as a metaphor for any divisible resource such as time or land, and our aim is to perform the division in a fair manner. This problem has a long and storied history that dates back over 70 years (Steinhaus, 1948;Dubins & Spanier, 1961;Stromquist, 1980;Brams & Taylor, 1995;Su, 1999;Stromquist, 2008;Edmonds & Pruhs, 2011;Aziz & Mackenzie, 2016) and has received considerable attention from artificial intelligence researchers in the past decade (Caragiannis et al, 2011;Bei et al, 2012;Aumann et al, 2013;Balkanski et al, 2014;Brânzei & Miltersen, 2015;Alijani et al, 2017;Menon & Larson, 2017;Bei et al, 2018;Segal-Halevi, 2018;Hosseini et al, 2020).…”
Section: Introductionmentioning
confidence: 99%