{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T14:34:10Z","timestamp":1780151650154,"version":"3.54.0"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115786","type":"journal-article","created":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:12:35Z","timestamp":1769271155000},"page":"115786","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Proportional allocations of multi-layered cakes"],"prefix":"10.1016","volume":"1068","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5030-9645","authenticated-orcid":false,"given":"Mohammad","family":"Azharuddin Sanpui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115786_bib0001","series-title":"Fair Division: From cake-cutting to dispute resolution","author":"Brams","year":"1996"},{"key":"10.1016\/j.tcs.2026.115786_bib0002","series-title":"Fair Division and Collective Welfare","author":"Moulin","year":"2004"},{"key":"10.1016\/j.tcs.2026.115786_bib0003","series-title":"Cake-Cutting Algorithms: Be Fair If You Can","author":"Robertson","year":"1998"},{"key":"10.1016\/j.tcs.2026.115786_bib0004","series-title":"Handbook of cOmputational Social Choice","author":"Brandt","year":"2016"},{"issue":"4","key":"10.1016\/j.tcs.2026.115786_bib0005","doi-asserted-by":"crossref","first-page":"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 (TALG)"},{"issue":"4","key":"10.1016\/j.tcs.2026.115786_bib0006","doi-asserted-by":"crossref","first-page":"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. (TEAC)"},{"key":"10.1016\/j.tcs.2026.115786_bib0007","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","article-title":"The efficiency of fair division","volume":"50","author":"Caragiannis","year":"2012","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"10.1016\/j.tcs.2026.115786_bib0008","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":"7","key":"10.1016\/j.tcs.2026.115786_bib0009","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/2483852.2483870","article-title":"Cake cutting: not just child\u2019s play","volume":"56","author":"Procaccia","year":"2013","journal-title":"Commun. ACM"},{"key":"10.1016\/j.tcs.2026.115786_bib0010","first-page":"37905","article-title":"The query complexity of cake cutting","volume":"35","author":"Br\u00e2nzei","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"10.1016\/j.tcs.2026.115786_bib0011","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1995.11990526","article-title":"An envy-free cake division protocol","volume":"102","author":"Brams","year":"1995","journal-title":"Am. Math. Monthly"},{"issue":"10","key":"10.1016\/j.tcs.2026.115786_bib0012","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1080\/00029890.1999.12005142","article-title":"Rental harmony: Sperner\u2019s lemma in fair division","volume":"106","author":"Edward Su","year":"1999","journal-title":"Am. Math. Monthly"},{"issue":"8","key":"10.1016\/j.tcs.2026.115786_bib0013","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. Monthly"},{"issue":"1P1","key":"10.1016\/j.tcs.2026.115786_bib0014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00029890.1961.11989615","article-title":"How to cut a cake fairly","volume":"68","author":"Dubins","year":"1961","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/j.tcs.2026.115786_bib0015","series-title":"Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing","first-page":"454","article-title":"A discrete and bounded envy-free cake cutting protocol for four agents","author":"Aziz","year":"2016"},{"key":"10.1016\/j.tcs.2026.115786_bib0016","series-title":"2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"416","article-title":"A discrete and bounded envy-free cake cutting protocol for any number of agents","author":"Aziz","year":"2016"},{"issue":"4","key":"10.1016\/j.tcs.2026.115786_bib0017","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1145\/3382129","article-title":"A bounded and envy-free cake cutting algorithm","volume":"63","author":"Aziz","year":"2020","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/j.tcs.2026.115786_bib0018","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."},{"issue":"1","key":"10.1016\/j.tcs.2026.115786_bib0019","doi-asserted-by":"crossref","DOI":"10.37236\/735","article-title":"Envy-free cake divisions cannot be found by finite protocols","volume":"15","author":"Stromquist","year":"2008","journal-title":"Electron. J. Combinatorics"},{"key":"10.1016\/j.tcs.2026.115786_bib0020","series-title":"International Joint Conference on Artificial Intelligence","article-title":"Fair division of time: multi-layered cake cutting","author":"Hosseini","year":"2020"},{"issue":"3","key":"10.1016\/j.tcs.2026.115786_bib0021","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3355902","article-title":"The unreasonable fairness of maximum nash welfare","volume":"7","author":"Caragiannis","year":"2019","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"10.1016\/j.tcs.2026.115786_bib0022","series-title":"Twenty-First International Joint Conference on Artificial Intelligence","article-title":"Thou shalt covet thy neighbor\u2019s cake","author":"Procaccia","year":"2009"},{"issue":"6","key":"10.1016\/j.tcs.2026.115786_bib0023","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1287\/opre.1120.1116","article-title":"Algorithmic solutions for envy-free cake cutting","volume":"60","author":"Deng","year":"2012","journal-title":"Oper. Res."},{"key":"10.1016\/j.tcs.2026.115786_bib0024","series-title":"The Geometry of Efficient Fair Division","author":"Barbanel","year":"2005"},{"key":"10.1016\/j.tcs.2026.115786_bib0025","series-title":"Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems","first-page":"343","article-title":"Computing socially-efficient cake divisions","author":"Aumann","year":"2013"},{"key":"10.1016\/j.tcs.2026.115786_bib0026","series-title":"International Conference on Web and Internet Economics","first-page":"504","article-title":"Envy-free division of multi-layered cakes","author":"Igarashi","year":"2021"},{"issue":"6","key":"10.1016\/j.tcs.2026.115786_bib0027","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/j.orl.2013.07.010","article-title":"Envy-free two-player m-cake and three-player two-cake divisions","volume":"41","author":"Lebert","year":"2013","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.tcs.2026.115786_bib0028","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.dam.2019.12.018","article-title":"Fair division with multiple pieces","volume":"283","author":"Nyman","year":"2020","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.115786_bib0029","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.mathsocsci.2009.09.002","article-title":"Two-player envy-free multi-cake division","volume":"59","author":"Cloutier","year":"2010","journal-title":"Math. Soc. Sci."},{"issue":"437","key":"10.1016\/j.tcs.2026.115786_bib0030","doi-asserted-by":"crossref","first-page":"212","DOI":"10.2307\/3616548","article-title":"Sharing a cake","volume":"66","author":"Austin","year":"1982","journal-title":"Math. Gazette"},{"issue":"3","key":"10.1016\/j.tcs.2026.115786_bib0031","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0001-8708(87)90055-7","article-title":"Splitting necklaces","volume":"63","author":"Alon","year":"1987","journal-title":"Adv. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000459?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000459?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:05:21Z","timestamp":1772193921000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":31,"alternative-id":["S0304397526000459"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115786","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Proportional allocations of multi-layered cakes","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115786","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115786"}}