{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T02:49:34Z","timestamp":1781664574449,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T00:00:00Z","timestamp":1534204800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s00453-018-0500-z","type":"journal-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T12:55:54Z","timestamp":1534251354000},"page":"1728-1755","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts"],"prefix":"10.1007","volume":"81","author":[{"given":"Masoud","family":"Seddighin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Majid","family":"Farhadi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reza","family":"Alijani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmad S.","family":"Tajik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"500_CR1","doi-asserted-by":"crossref","unstructured":"Alijani, R., Farhadi, M., Ghodsi, M., Seddighin, M., Tajik, A.S.: Envy-free mechanisms with minimum number of cuts. In: Thirty-First AAAI Conference on Artificial Intelligence (2017)","DOI":"10.1609\/aaai.v31i1.10584"},{"key":"500_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: 2016 IEEE 57th Annual Symposium onFoundations of Computer Science (FOCS), pp. 416\u2013427. IEEE (2016)","DOI":"10.1109\/FOCS.2016.52"},{"key":"500_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Ye, C.: Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In: International Conference on Web and Internet Economics, pp. 1\u201314. Springer (2014)","DOI":"10.1007\/978-3-319-13129-0_1"},{"key":"500_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.mathsocsci.2004.03.006","volume":"48","author":"JB Barbanel","year":"2004","unstructured":"Barbanel, J.B., Brams, S.J.: Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond. Math. Soc. Sci. 48, 251\u2013269 (2004)","journal-title":"Math. Soc. Sci."},{"key":"500_CR5","unstructured":"Bei, X., Chen, N., Hua, X., Tao, B., Yang, E.: Optimal proportional cake cutting with connected pieces. In: Twenty-sixth AAAI Conference on Artificial Intelligence (2012)"},{"key":"500_CR6","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Huzhang, G., Tao, B., Wu, J.: Cake cutting: envy and truth. In: Twenty-sixth International Joint Conference on Artificial Intelligence, pp. 3625\u20133631. AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/507"},{"key":"500_CR7","unstructured":"Brams, S.J., Feldman, M., Lai, J.K., Morgenstern, J., Procaccia, A.D.: On maxsum fair cake divisions. In: Twenty-sixth AAAI Conference on Artificial Intelligence (2012)"},{"key":"500_CR8","first-page":"1314","volume":"53","author":"SJ Brams","year":"2006","unstructured":"Brams, S.J., Jones, M.A., Klamler, C.: Better ways to cut a cake. Not. AMS 53, 1314\u20131321 (2006)","journal-title":"Not. AMS"},{"key":"500_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1995.11990526","volume":"102","author":"SJ Brams","year":"1995","unstructured":"Brams, S.J., Taylor, A.D.: An envy-free cake division protocol. Am. Math. Mon. 102, 9\u201318 (1995)","journal-title":"Am. Math. Mon."},{"key":"500_CR10","first-page":"127","volume":"22","author":"I Caragiannis","year":"2011","unstructured":"Caragiannis, I., Lai, J.K., Procaccia, A.D.: Towards more expressive cake cutting. IJCAI Proc. Int. Jt. Conf. Artif. Intell. 22, 127 (2011)","journal-title":"IJCAI Proc. Int. Jt. Conf. Artif. Intell."},{"key":"500_CR11","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. Games Econ. Beh. 77, 284\u2013297 (2013)","journal-title":"Games Econ. Beh."},{"key":"500_CR12","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1287\/opre.1120.1116","volume":"60","author":"X Deng","year":"2012","unstructured":"Deng, X., Qi, Q., Saberi, A.: Algorithmic solutions for envy-free cake cutting. Oper. Res. 60, 1461\u20131476 (2012)","journal-title":"Oper. Res."},{"key":"500_CR13","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Lai, J.K., Procaccia, A.D.: How to cut a cake before the party ends. In: Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8629"},{"key":"500_CR14","doi-asserted-by":"crossref","unstructured":"Maya, A., Nisan, N.: Incentive compatible two player cake cutting. In: International Workshop on Internet and Network Economics, pp. 170\u2013183. Springer (2012)","DOI":"10.1007\/978-3-642-35311-6_13"},{"key":"500_CR15","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2483852.2483870","volume":"56","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D.: Cake cutting: not just child\u2019s play. Commun. ACM 56, 78\u201387 (2013)","journal-title":"Commun. ACM"},{"key":"500_CR16","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D.: Cake cutting algorithms. In: Handbook of Computational Social Choice, chapter 13, Citeseer (2015)","DOI":"10.1017\/CBO9781107446984.014"},{"key":"500_CR17","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16, 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"500_CR18","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1080\/00029890.1980.11995109","volume":"87","author":"W Stromquist","year":"1980","unstructured":"Stromquist, W.: How to cut a cake fairly. Am. Math. Mon. 87, 640\u2013644 (1980)","journal-title":"Am. Math. Mon."},{"key":"500_CR19","doi-asserted-by":"crossref","first-page":"11","DOI":"10.37236\/735","volume":"15","author":"W Stromquist","year":"2008","unstructured":"Stromquist, W.: Envy-free cake divisions cannot be found by finite protocols. Electr. J. Comb. 15, 11 (2008)","journal-title":"Electr. J. Comb."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0500-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0500-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0500-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T06:30:13Z","timestamp":1661754613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0500-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,14]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["500"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0500-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,14]]},"assertion":[{"value":"26 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}