{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:14:05Z","timestamp":1760300045768,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319996592"},{"type":"electronic","value":"9783319996608"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99660-8_9","type":"book-chapter","created":{"date-parts":[[2018,8,26]],"date-time":"2018-08-26T18:19:21Z","timestamp":1535307561000},"page":"87-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Improved Envy-Free Cake Cutting Protocol for Four Agents"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Amanatidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Christodoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Fearnley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Markakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos-Alexandros","family":"Psomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eftychia","family":"Vakaliou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Christodoulou, G., Fearnley, J., Markakis, E., Psomas, C.A., Vakaliou, E.: An improved envy-free cake cutting protocol for four agents (2018). https:\/\/arxiv.org\/pdf\/1807.00317.pdf","DOI":"10.1007\/978-3-319-99660-8_9"},{"key":"9_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: 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016, pp. 416\u2013427 (2016)","DOI":"10.1109\/FOCS.2016.52"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for four agents. In: 48th ACM Symposium on the Theory of Computing, STOC 2016, pp. 454\u2013464 (2016)","DOI":"10.1109\/FOCS.2016.52"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-13129-0_1","volume-title":"Web and Internet Economics","author":"H Aziz","year":"2014","unstructured":"Aziz, H., Ye, C.: Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 1\u201314. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_1"},{"issue":"1","key":"9_CR5","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. Monthly 102(1), 9\u201318 (1995)","journal-title":"Am. Math. Monthly"},{"key":"9_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division: from Cake Cutting to Dispute Resolution","author":"SJ Brams","year":"1996","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division: from Cake Cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ipl.2014.07.005","volume":"115","author":"S Branzei","year":"2015","unstructured":"Branzei, S.: A note on envy-free cake cutting with polynomial valuations. Inf. Process. Lett. 115(2), 93\u201395 (2015)","journal-title":"Inf. Process. Lett."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00029890.1961.11989615","volume":"68","author":"L Dubins","year":"1961","unstructured":"Dubins, L., Spanier, E.: How to cut a cake fairly. Am. Math. Monthly 68, 1\u201317 (1961)","journal-title":"Am. Math. Monthly"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Lai, J.K., Procaccia, A.D.: How to cut a cake before the party ends. In: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2013, pp. 555\u2013561 (2013)","DOI":"10.1609\/aaai.v27i1.8629"},{"issue":"8","key":"9_CR10","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1080\/00029890.2000.12005263","volume":"107","author":"O Pikhurko","year":"2000","unstructured":"Pikhurko, O.: On envy-free cake division. Am. Math. Monthly 107(8), 736\u2013738 (2000)","journal-title":"Am. Math. Monthly"},{"key":"9_CR11","unstructured":"Procaccia, A.D.: Thou shalt covet thy neighbor\u2019s cake. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, pp. 239\u2013244 (2009)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D.: Cake cutting algorithms. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, chap. 13. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.014"},{"key":"9_CR13","first-page":"97","volume":"45","author":"JM Robertson","year":"1997","unstructured":"Robertson, J.M., Webb, W.A.: Near exact and envy-free cake division. Ars Combinatorica 45, 97\u2013108 (1997)","journal-title":"Ars Combinatorica"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Robertson, J.M., Webb, W.A.: Cake Cutting Algorithms: be fair if you can. AK Peters (1998)","DOI":"10.1201\/9781439863855"},{"key":"9_CR15","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: Waste makes haste: Bounded time algorithms for envy-free cake cutting with free disposal (2018). https:\/\/arxiv.org\/pdf\/1511.02599.pdf"},{"issue":"8","key":"9_CR16","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. Monthly 87(8), 640\u2013644 (1980)","journal-title":"Am. Math. Monthly"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Stromquist, W.: Envy-free cake divisions cannot be found by finite protocols. Electr. J. Comb. 15(1) (2008)","DOI":"10.37236\/735"},{"issue":"10","key":"9_CR18","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2307\/2589747","volume":"106","author":"FE Su","year":"1999","unstructured":"Su, F.E.: Rental harmony: sperner\u2019s lemma in fair division. Am. Math. Monthly 106(10), 930\u2013942 (1999)","journal-title":"Am. Math. Monthly"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.disopt.2006.07.003","volume":"4","author":"G Woeginger","year":"2007","unstructured":"Woeginger, G., Sgall, J.: On the complexity of cake cutting. Discrete Optim. 4(2), 213\u2013220 (2007)","journal-title":"Discrete Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99660-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:40:48Z","timestamp":1709833248000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99660-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319996592","9783319996608"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99660-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aims.sjtu.edu.cn\/SAGT_2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}