{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T04:29:19Z","timestamp":1729225759334,"version":"3.27.0"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"value":"9781643685489","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,10,16]]},"abstract":"<jats:p>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\u2014one 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\u00b72n) 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. The full version is available at https:\/\/arxiv.org\/abs\/2312.15326.<\/jats:p>","DOI":"10.3233\/faia240885","type":"book-chapter","created":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T13:38:09Z","timestamp":1729172289000},"source":"Crossref","is-referenced-by-count":0,"title":["On Connected Strongly-Proportional Cake-Cutting"],"prefix":"10.3233","author":[{"given":"Zsuzsanna","family":"Jank\u00f3","sequence":"first","affiliation":[{"name":"Corvinus University of Budapest, HUN-REN Centre for Economic and Regional Studies"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Attila","family":"Jo\u00f3","sequence":"additional","affiliation":[{"name":"University of Hamburg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erel","family":"Segal-Halevi","sequence":"additional","affiliation":[{"name":"Ariel University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung Man","family":"Yuen","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2024"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA240885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T13:38:09Z","timestamp":1729172289000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA240885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9781643685489"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia240885","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,16]]}}}