{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T12:49:25Z","timestamp":1745412565309,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030946753"},{"type":"electronic","value":"9783030946760"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94676-0_28","type":"book-chapter","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T16:03:08Z","timestamp":1642694588000},"page":"504-521","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Envy-free Division of\u00a0Multi-layered Cakes"],"prefix":"10.1007","author":[{"given":"Ayumi","family":"Igarashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Meunier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Asada, M., et al.: Fair division and generalizations of Sperner- and KKM-type results. SIAM J. Discrete Math. 32(1), 591\u2013610 (2018)","DOI":"10.1137\/17M1116210"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1112\/mtk.12059","volume":"67","author":"S Avvakumov","year":"2020","unstructured":"Avvakumov, S., Karasev, R.: Envy-free division using mapping degree. Mathematika 67(1), 36\u201353 (2020)","journal-title":"Mathematika"},{"key":"28_CR3","unstructured":"Avvakumov, S., Karasev, R.: Equipartition of a segment. arXiv preprint arXiv:2009.09862 (2020)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS), pp. 416\u2013427 (2016)","DOI":"10.1109\/FOCS.2016.52"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rner, A., Lov\u00e1sz, L., Vrecica, S.T., \u017divaljevi\u0107, R.T.: Chessboard complexes and matching complexes. J. London Math. Soc. 49(1), 25\u201339 (1994)","DOI":"10.1112\/jlms\/49.1.25"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Cloutier, J., Nyman, K.L., Su, F.E.: Two-player envy-free multi-cake division. Math. Soc. Sci. 59(1), 26\u201337 (2010)","DOI":"10.1016\/j.mathsocsci.2009.09.002"},{"key":"28_CR7","doi-asserted-by":"publisher","unstructured":"De Longueville, M.: A Course in Topological Combinatorics. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4419-7910-0","DOI":"10.1007\/978-1-4419-7910-0"},{"issue":"6","key":"28_CR8","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(6), 1461\u20131476 (2012)","journal-title":"Oper. Res."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Am. Math. Mon. 68(1), 1\u201317 (1961)","DOI":"10.1080\/00029890.1961.11989615"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/S0021-9800(67)80063-2","volume":"2","author":"K Fan","year":"1967","unstructured":"Fan, K.: Simplicial maps from an orientable $$n$$-pseudomanifold into $$S^m$$ with the octahedral triangulation. J. Comb. Theor. 2, 588\u2013602 (1967)","journal-title":"J. Comb. Theor."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Filos-Ratsikas, A., Hollender, A., Sotiraki, K., Zampetakis, M.: A topological characterization of modulo-p arguments and implications for necklace splitting. In: Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2615\u20132634 (2020)","DOI":"10.1137\/1.9781611976465.155"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Hosseini, H., Igarashi, A., Searns, A.: Fair division of time: multi-layered cake cutting. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pp. 182\u2013188 (2020)","DOI":"10.24963\/ijcai.2020\/26"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Meunier, F.: Envy-free division of multi-layered cakes. CoRR, arXiv:2106.02262 (2021)","DOI":"10.1007\/978-3-030-94676-0_28"},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1137\/20M1331949","volume":"35","author":"D Joji\u0107","year":"2021","unstructured":"Joji\u0107, D., Panina, G., \u017divaljevi\u0107, R.: Splitting necklaces, with constraints. SIAM J. Discret. Math. 35(2), 1268\u20131286 (2021)","journal-title":"SIAM J. Discret. Math."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: Some combinatorial lemmas in topology. IBM J. Res. Dev. 4(5), 518\u2013524 (1960)","DOI":"10.1147\/rd.45.0518"},{"issue":"6","key":"28_CR16","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.orl.2013.07.010","volume":"41","author":"N Lebert","year":"2013","unstructured":"Lebert, N., Meunier, F., Carbonneaux, Q.: Envy-free two-player m-cake and three-player two-cake divisions. Oper. Res. Lett. 41(6), 607\u2013610 (2013)","journal-title":"Oper. Res. Lett."},{"key":"28_CR17","doi-asserted-by":"publisher","unstructured":"Matou\u0161ek, J.: Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-76649-0","DOI":"10.1007\/978-3-540-76649-0"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Meunier, F., Su, F.E.: Multilabeled versions of Sperner\u2019s and Fan\u2019s lemmas and applications. SIAM J. Appl. Algebra and Geom. 3(3), 391\u2013411 (2019)","DOI":"10.1137\/18M1192548"},{"issue":"2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s11856-019-1939-6","volume":"234","author":"F Meunier","year":"2019","unstructured":"Meunier, F., Zerbib, S.: Envy-free cake division without assuming the players prefer nonempty pieces. Israel J. Math. 234(2), 907\u2013925 (2019). https:\/\/doi.org\/10.1007\/s11856-019-1939-6","journal-title":"Israel J. Math."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Nyman, K., Su, F.E., Zerbib, S.: Fair division with multiple pieces. Discret. Appl. Math. 283, 115\u2013122 (2020)","DOI":"10.1016\/j.dam.2019.12.018"},{"key":"28_CR21","unstructured":"Panina, G., \u017divaljevi\u0107, R.T.: Envy-free division via configuration spaces. arXiv preprint arXiv:2102.06886 (2021)"},{"key":"28_CR22","unstructured":"Segal-Halevi, E.: Fairly dividing a cake after some parts were burnt in the oven. In: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 1276\u20131284 (2018)"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2020.10.011","volume":"291","author":"E Segal-Halevi","year":"2021","unstructured":"Segal-Halevi, E.: Fair multi-cake cutting. Discret. Appl. Math. 291, 15\u201335 (2021)","journal-title":"Discret. Appl. Math."},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"315","DOI":"10.2307\/1907319","volume":"17","author":"H Steinhaus","year":"1949","unstructured":"Steinhaus, H.: Sur la division pragmatique. Econometrica 17, 315\u2013319 (1949)","journal-title":"Econometrica"},{"issue":"8","key":"28_CR25","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(8), 640\u2013644 (1980)","journal-title":"Am. Math. Mon."},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Stromquist, W.: Envy-free cake divisions cannot be found by finite protocols. Electron. J. Comb. 15(1), R11 (2008)","DOI":"10.37236\/735"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Su, F.E.: Rental harmony: Sperner\u2019s lemma in fair division. Am. Math. Mon. 106(10), 930\u2013942 (1999)","DOI":"10.1080\/00029890.1999.12005142"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Volovikov, A.Y.: On a topological generalization of the Tverberg theorem. Math. Not. 59(3), 324\u2013326 (1996)","DOI":"10.1007\/BF02308547"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Woodall, D.R.: Dividing a cake fairly. J. Math. Anal. Appl. 78(1), 233\u2013247 (1980)","DOI":"10.1016\/0022-247X(80)90225-5"},{"key":"28_CR30","unstructured":"\u017divaljevi\u0107, R.T.: User\u2019s guide to equivariant methods in combinatorics. II. Publications de l\u2019Institut Math\u00e9matique. Nouvelle S\u00e9rie 64, 107\u2013132 (1998)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94676-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T21:27:51Z","timestamp":1651181271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94676-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030946753","9783030946760"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94676-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpi.de\/wine2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.07","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}