@inproceedings{fd1a6e8155d246cdbd81c75276b59274,
title = "On Connected Strongly-Proportional Cake-Cutting",
abstract = "We investigate the problem of fairly dividing a divisible heterogeneous resource, also known as a cake, among a set of agents who may have different entitlements. We characterize the existence of a connected strongly-proportional allocation—one in which every agent receives a contiguous piece worth strictly more than their proportional share. The characterization is supplemented with an algorithm that determines its existence using O(n·2n) queries. We devise a simpler characterization for agents with strictly positive valuations and with equal entitlements, and present an algorithm to determine the existence of such an allocation using O(n2) queries. We provide matching lower bounds in the number of queries for both algorithms. When a connected strongly-proportional allocation exists, we show that it can also be computed using a similar number of queries.",
author = "Zsuzsanna Jank{\'o} and Attila Jo{\'o} and Erel Segal-Halevi and Yuen, \{Sheung Man\}",
note = "Publisher Copyright: {\textcopyright} 2024 The Authors.; 27th European Conference on Artificial Intelligence, ECAI 2024 ; Conference date: 19-10-2024 Through 24-10-2024",
year = "2024",
month = oct,
day = "16",
doi = "10.3233/FAIA240885",
language = "אנגלית",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press BV",
pages = "3356--3363",
editor = "Ulle Endriss and Melo, \{Francisco S.\} and Kerstin Bach and Alberto Bugarin-Diz and Alonso-Moral, \{Jose M.\} and Senen Barro and Fredrik Heintz",
booktitle = "ECAI 2024 - 27th European Conference on Artificial Intelligence, Including 13th Conference on Prestigious Applications of Intelligent Systems, PAIS 2024, Proceedings",
address = "הולנד",
}