{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T22:31:55Z","timestamp":1772317915159,"version":"3.50.1"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T00:00:00Z","timestamp":1662595200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE-T2EP20221-0001"],"award-info":[{"award-number":["MOE-T2EP20221-0001"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["712\/20"],"award-info":[{"award-number":["712\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["639945"],"award-info":[{"award-number":["639945"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1016\/j.artint.2022.103783","type":"journal-article","created":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T02:01:15Z","timestamp":1662688875000},"page":"103783","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Mind the gap: Cake cutting with separation"],"prefix":"10.1016","volume":"313","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[]},{"given":"Erel","family":"Segal-Halevi","sequence":"additional","affiliation":[]},{"given":"Warut","family":"Suksompong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2022.103783_br0010","series-title":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","first-page":"312","article-title":"Envy-free mechanisms with minimum number of cuts","author":"Alijani","year":"2017"},{"key":"10.1016\/j.artint.2022.103783_br0020","series-title":"Proceedings of the 15th Conference on Web and Internet Economics","first-page":"57","article-title":"Fair and efficient cake division with connected pieces","author":"Arunachaleswaran","year":"2019"},{"key":"10.1016\/j.artint.2022.103783_br0030","series-title":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence","first-page":"1732","article-title":"Fair division with a secretive agent","author":"Arunachaleswaran","year":"2019"},{"issue":"4","key":"10.1016\/j.artint.2022.103783_br0040","doi-asserted-by":"crossref","first-page":"23:1","DOI":"10.1145\/2781776","article-title":"The efficiency of fair division with connected pieces","volume":"3","author":"Aumann","year":"2015","journal-title":"ACM Trans. Econ. Comput."},{"key":"10.1016\/j.artint.2022.103783_br0050","series-title":"Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems","first-page":"343","article-title":"Computing socially-efficient cake divisions","author":"Aumann","year":"2013"},{"key":"10.1016\/j.artint.2022.103783_br0060","series-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence","first-page":"46","article-title":"Weighted maxmin fair share allocation of indivisible chores","author":"Aziz","year":"2019"},{"issue":"1","key":"10.1016\/j.artint.2022.103783_br0070","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1287\/moor.2020.1062","article-title":"Competitive equilibrium with indivisible goods and generic budgets","volume":"46","author":"Babaioff","year":"2021","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.artint.2022.103783_br0080","series-title":"Proceedings of the 28th AAAI Conference on Artificial Intelligence","first-page":"566","article-title":"Simultaneous cake cutting","author":"Balkanski","year":"2014"},{"issue":"1","key":"10.1016\/j.artint.2022.103783_br0090","doi-asserted-by":"crossref","first-page":"59","DOI":"10.4064\/cm-69-1-59-73","article-title":"Game-theoretic algorithms for fair and strongly fair cake division with entitlements","volume":"69","author":"Barbanel","year":"1995","journal-title":"Colloq. Math."},{"issue":"6","key":"10.1016\/j.artint.2022.103783_br0100","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1080\/00029890.2009.11920966","article-title":"Cutting a pie is not a piece of cake","volume":"116","author":"Barbanel","year":"2009","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.artint.2022.103783_br0110","series-title":"Proceedings of the 26th AAAI Conference on Artificial Intelligence","first-page":"1263","article-title":"Optimal proportional cake cutting with connected pieces","author":"Bei","year":"2012"},{"key":"10.1016\/j.artint.2022.103783_br0120","series-title":"Proceedings of the 26th International Joint Conference on Artificial Intelligence","first-page":"3625","article-title":"Cake cutting: envy and truth","author":"Bei","year":"2017"},{"issue":"2","key":"10.1016\/j.artint.2022.103783_br0130","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1137\/20M1388310","article-title":"The price of connectivity in fair division","volume":"36","author":"Bei","year":"2022","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.artint.2022.103783_br0140","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.geb.2021.11.006","article-title":"Almost envy-free allocations with connected bundles","volume":"131","author":"Bil\u00f2","year":"2022","journal-title":"Games Econ. Behav."},{"key":"10.1016\/j.artint.2022.103783_br0150","article-title":"Guarantees in fair division: general or monotone preferences","author":"Bogomolnaia","year":"2022","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.artint.2022.103783_br0160","series-title":"Proceedings of the 26th International Joint Conference on Artificial Intelligence","first-page":"135","article-title":"Fair division of a graph","author":"Bouveret","year":"2017"},{"key":"10.1016\/j.artint.2022.103783_br0170","series-title":"Fair Division: From Cake-Cutting to Dispute Resolution","author":"Brams","year":"1996"},{"issue":"3\u20134","key":"10.1016\/j.artint.2022.103783_br0180","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s00182-007-0108-z","article-title":"Proportional pie-cutting","volume":"36","author":"Brams","year":"2008","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/j.artint.2022.103783_br0190","author":"Br\u00e2nzei"},{"key":"10.1016\/j.artint.2022.103783_br0200","series-title":"Proceedings of the 30th AAAI Conference on Artificial Intelligence","first-page":"418","article-title":"An algorithmic framework for strategic fair division","author":"Br\u00e2nzei","year":"2016"},{"issue":"6","key":"10.1016\/j.artint.2022.103783_br0210","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1086\/664613","article-title":"The combinatorial assignment problem: approximate competitive equilibrium from equal incomes","volume":"119","author":"Budish","year":"2011","journal-title":"J. Polit. Econ."},{"issue":"4","key":"10.1016\/j.artint.2022.103783_br0220","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.disopt.2012.08.001","article-title":"On the computability of equitable divisions","volume":"9","author":"Cechl\u00e1rov\u00e1","year":"2012","journal-title":"Discrete Optim."},{"key":"10.1016\/j.artint.2022.103783_br0230","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ins.2012.11.024","article-title":"On the existence of equitable cake divisions","volume":"228","author":"Cechl\u00e1rov\u00e1","year":"2013","journal-title":"Inf. Sci."},{"issue":"3","key":"10.1016\/j.artint.2022.103783_br0240","doi-asserted-by":"crossref","first-page":"18:1","DOI":"10.1145\/3457166","article-title":"Weighted envy-freeness in indivisible item allocation","volume":"9","author":"Chakraborty","year":"2021","journal-title":"ACM Trans. Econ. Comput."},{"key":"10.1016\/j.artint.2022.103783_br0250","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2021.103578","article-title":"Picking sequences and monotonicity in weighted fair division","volume":"301","author":"Chakraborty","year":"2021","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2022.103783_br0260","series-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence","first-page":"4949","article-title":"Weighted fairness notions for indivisible items revisited","author":"Chakraborty","year":"2022"},{"key":"10.1016\/j.artint.2022.103783_br0270","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.mathsocsci.2017.03.006","article-title":"Existence of a simple and equitable fair division: a short proof","volume":"87","author":"Ch\u00e8ze","year":"2017","journal-title":"Math. Soc. Sci."},{"issue":"5","key":"10.1016\/j.artint.2022.103783_br0280","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1112\/blms.12368","article-title":"Disproportionate division","volume":"52","author":"Crew","year":"2020","journal-title":"Bull. Lond. Math. Soc."},{"issue":"3","key":"10.1016\/j.artint.2022.103783_br0290","doi-asserted-by":"crossref","first-page":"29:1","DOI":"10.1145\/3380742","article-title":"The complexity of cake cutting with unequal shares","volume":"16","author":"Cseh","year":"2020","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.artint.2022.103783_br0300","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2311357","article-title":"How to cut a cake fairly","volume":"68","author":"Dubins","year":"1961","journal-title":"Am. Math. Mon."},{"issue":"4","key":"10.1016\/j.artint.2022.103783_br0310","doi-asserted-by":"crossref","first-page":"51:1","DOI":"10.1145\/2000807.2000819","article-title":"Cake cutting really is not a piece of cake","volume":"7","author":"Edmonds","year":"2011","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.artint.2022.103783_br0320","series-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence","first-page":"5330","article-title":"Mind the gap: cake cutting with separation","author":"Elkind","year":"2021"},{"key":"10.1016\/j.artint.2022.103783_br0330","series-title":"Proceedings of the 30th International Joint Conference on Artificial Intelligence","first-page":"161","article-title":"Graphical cake cutting via maximin share","author":"Elkind","year":"2021"},{"key":"10.1016\/j.artint.2022.103783_br0340","series-title":"Proceedings of the 30th International Joint Conference on Artificial Intelligence","first-page":"168","article-title":"Keep your distance: land division with separation","author":"Elkind","year":"2021"},{"issue":"3","key":"10.1016\/j.artint.2022.103783_br0350","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0166-218X(84)90005-2","article-title":"A note on cake cutting","volume":"7","author":"Even","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.artint.2022.103783_br0360","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.1.11291","article-title":"Fair allocation of indivisible goods to asymmetric agents","volume":"64","author":"Farhadi","year":"2019","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2022.103783_br0370","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1613\/jair.1.12222","article-title":"Contiguous cake cutting: hardness results and approximation algorithms","volume":"69","author":"Goldberg","year":"2020","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2022.103783_br0380","series-title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence","first-page":"182","article-title":"Fair division of time: multi-layered cake cutting","author":"Hosseini","year":"2020"},{"key":"10.1016\/j.artint.2022.103783_br0390","series-title":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence","first-page":"2045","article-title":"Pareto-optimal allocation of indivisible goods with connectivity constraints","author":"Igarashi","year":"2019"},{"key":"10.1016\/j.artint.2022.103783_br0400","series-title":"OTM Confederated International Conferences \u201cOn the Move to Meaningful Internet Systems\u201d","first-page":"453","article-title":"Multiagent negotiation for fair and unbiased resource allocation","author":"Iyer","year":"2005"},{"issue":"2","key":"10.1016\/j.artint.2022.103783_br0410","first-page":"8:1","article-title":"Fair enough: guaranteeing approximate maximin shares","volume":"64","author":"Kurokawa","year":"2018","journal-title":"J. ACM"},{"key":"10.1016\/j.artint.2022.103783_br0420","series-title":"Proceedings of the 24th International Joint Conference on Artificial Intelligence","first-page":"589","article-title":"Truthful cake cutting mechanisms with externalities: do not make them care for others too much!","author":"Li","year":"2015"},{"key":"10.1016\/j.artint.2022.103783_br0430","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1613\/jair.1.11702","article-title":"Maximin share allocations on cycles","volume":"69","author":"Lonc","year":"2020","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2022.103783_br0440","series-title":"Proceedings of the 26th International Joint Conference on Artificial Intelligence","first-page":"352","article-title":"Deterministic, strategyproof, and fair cake cutting","author":"Menon","year":"2017"},{"key":"10.1016\/j.artint.2022.103783_br0450","series-title":"Handbook of Computational Social Choice","first-page":"311","article-title":"Cake cutting algorithms","author":"Procaccia","year":"2016"},{"key":"10.1016\/j.artint.2022.103783_br0460","series-title":"Proceedings of the 18th ACM Conference on Economics and Computation","first-page":"479","article-title":"A lower bound for equitable cake cutting","author":"Procaccia","year":"2017"},{"key":"10.1016\/j.artint.2022.103783_br0470","series-title":"Cake-Cutting Algorithms: Be Fair If You Can","author":"Robertson","year":"1998"},{"issue":"1","key":"10.1016\/j.artint.2022.103783_br0480","doi-asserted-by":"crossref","DOI":"10.1016\/j.jmaa.2019.123382","article-title":"Cake-cutting with different entitlements: how many cuts are needed?","volume":"480","author":"Segal-Halevi","year":"2019","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"10.1016\/j.artint.2022.103783_br0490","doi-asserted-by":"crossref","first-page":"26:1","DOI":"10.1007\/s10458-020-09444-z","article-title":"Competitive equilibrium for almost all incomes: existence and fairness","volume":"34","author":"Segal-Halevi","year":"2020","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"10.1016\/j.artint.2022.103783_br0500","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.dam.2020.10.011","article-title":"Fair multi-cake cutting","volume":"291","author":"Segal-Halevi","year":"2021","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.artint.2022.103783_br0510","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s00355-019-01210-9","article-title":"Fair cake-cutting among families","volume":"53","author":"Segal-Halevi","year":"2019","journal-title":"Soc. Choice Welf."},{"issue":"1","key":"10.1016\/j.artint.2022.103783_br0520","first-page":"101","article-title":"The problem of fair division","volume":"16","author":"Steinhaus","year":"1948","journal-title":"Econometrica"},{"issue":"8","key":"10.1016\/j.artint.2022.103783_br0530","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1080\/00029890.1980.11995109","article-title":"How to cut a cake fairly","volume":"87","author":"Stromquist","year":"1980","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.artint.2022.103783_br0540","article-title":"Envy-free cake divisions cannot be found by finite protocols","volume":"15","author":"Stromquist","year":"2008","journal-title":"Electron. J. Comb."},{"issue":"10","key":"10.1016\/j.artint.2022.103783_br0550","doi-asserted-by":"crossref","first-page":"930","DOI":"10.2307\/2589747","article-title":"Rental harmony: Sperner's lemma in fair division","volume":"106","author":"Su","year":"1999","journal-title":"Am. Math. Mon."},{"issue":"2","key":"10.1016\/j.artint.2022.103783_br0560","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/3505156.3505162","article-title":"Constraints in fair division","volume":"19","author":"Suksompong","year":"2021","journal-title":"ACM SIGecom Exch."},{"issue":"3","key":"10.1016\/j.artint.2022.103783_br0570","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00199-006-0109-3","article-title":"Children crying at birthday parties. Why?","volume":"31","author":"Thomson","year":"2007","journal-title":"Econ. Theory"},{"issue":"2","key":"10.1016\/j.artint.2022.103783_br0580","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.disopt.2006.07.003","article-title":"On the complexity of cake cutting","volume":"4","author":"Woeginger","year":"2007","journal-title":"Discrete Optim."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370222001230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370222001230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T07:25:17Z","timestamp":1757748317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370222001230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":58,"alternative-id":["S0004370222001230"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2022.103783","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2022,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mind the gap: Cake cutting with separation","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2022.103783","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"103783"}}