{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T00:29:46Z","timestamp":1746577786935,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031393433"},{"type":"electronic","value":"9783031393440"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-39344-0_20","type":"book-chapter","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:27:10Z","timestamp":1692995230000},"page":"263-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximize Egalitarian Welfare for\u00a0Cake Cutting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3997-4650","authenticated-orcid":false,"given":"Xiaolin","family":"Bu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4847-9183","authenticated-orcid":false,"given":"Jiaxin","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,26]]},"reference":[{"issue":"7","key":"20_CR1","doi-asserted-by":"publisher","first-page":"2970","DOI":"10.1137\/080723491","volume":"39","author":"A Asadpour","year":"2010","unstructured":"Asadpour, A., Saberi, A.: An approximation algorithm for max-min fair allocation of indivisible goods. SIAM J. Comput. 39(7), 2970\u20132989 (2010). https:\/\/doi.org\/10.1137\/080723491","journal-title":"SIAM J. Comput."},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2781776","volume":"3","author":"Y Aumann","year":"2015","unstructured":"Aumann, Y., Dombb, Y.: The Efficiency of Fair Division with Connected Pieces. ACM Trans. Econ. Comput. 3(4), 1\u201316 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"key":"20_CR3","unstructured":"Aumann, Y., Dombb, Y., Hassidim, A.: Computing socially-efficient cake divisions. In: Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 343\u2013350 (2013)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. arXiv:1604.03655 [cs.DS] (2017)","DOI":"10.1145\/2897518.2897522"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Barbanel, J.B., Brams, S.J.: Two-person cake-cutting: the optimal number of cuts. Available at SSRN 1946895 (2011)","DOI":"10.2139\/ssrn.1946895"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Hua, X., Tao, B., Yang, E.: Optimal proportional cake cutting with connected pieces. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI), pp. 1263\u20131269 (2012)","DOI":"10.1609\/aaai.v26i1.8243"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Huzhang, G., Tao, B., Wu, J.: Cake cutting: envy and truth. In: IJCAI, pp. 3625\u20133631 (2017)","DOI":"10.24963\/ijcai.2017\/507"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V.F., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17\u201331 (2011)","journal-title":"Oper. Res."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Feldman, M., Lai, J., Morgenstern, J., Procaccia, A.D.: On maxsum fair cake divisions. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1285\u20131291 (2012)","DOI":"10.1609\/aaai.v26i1.8237"},{"issue":"11","key":"20_CR10","first-page":"1314","volume":"53","author":"SJ Brams","year":"2006","unstructured":"Brams, S.J., Jones, M.A., Klamler, C., et al.: Better ways to cut a cake. Not. AMS 53(11), 1314\u20131321 (2006)","journal-title":"Not. AMS"},{"issue":"1","key":"20_CR11","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). http:\/\/www.jstor.org\/stable\/2974850","journal-title":"Am. Math. Monthly"},{"issue":"4","key":"20_CR12","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50(4), 589\u2013610 (2012)","journal-title":"Theory Comput. Syst."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Cohler, Y.J., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Optimal envy-free cake cutting. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI), pp. 626\u2013631 (2011)","DOI":"10.1609\/aaai.v25i1.7874"},{"issue":"1P1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00029890.1961.11989615","volume":"68","author":"LE Dubins","year":"1961","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Am. Math. Monthly 68(1P1), 1\u201317 (1961)","journal-title":"Am. Math. Monthly"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0166-218X(84)90005-2","volume":"7","author":"S Even","year":"1984","unstructured":"Even, S., Paz, A.: A note on cake cutting. Discret. Appl. Math. 7(3), 285\u2013296 (1984)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02096259","volume":"46","author":"O G\u00fcler","year":"1993","unstructured":"G\u00fcler, O., den Hertog, D., Roos, C., Terlaky, T., Tsuchiya, T.: Degeneracy in interior point methods for linear programming: a survey. Ann. Oper. Res. 46(1), 107\u2013138 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1080\/0025570X.2002.11953144","volume":"75","author":"MA Jones","year":"2002","unstructured":"Jones, M.A.: Equitable, envy-free, and efficient cake cutting for two people and its application to divisible goods. Math. Mag. 75(4), 275\u2013283 (2002)","journal-title":"Math. Mag."},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"F Kelly","year":"1997","unstructured":"Kelly, F.: Charging and rate control for elastic traffic. Eur. Trans. Telecommun. 8(1), 33\u201337 (1997)","journal-title":"Eur. Trans. Telecommun."},{"issue":"7","key":"20_CR19","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1785414.1785439","volume":"53","author":"T Roughgarden","year":"2010","unstructured":"Roughgarden, T.: Algorithmic game theory. Commun. ACM 53(7), 78\u201386 (2010)","journal-title":"Commun. ACM"},{"issue":"1","key":"20_CR20","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16(1), 101\u2013104 (1948)","journal-title":"Econometrica"},{"issue":"1949","key":"20_CR21","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(1949), 315\u2013319 (1949)","journal-title":"Econometrica"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Tao, B.: On existence of truthful fair cake cutting mechanisms. In: Proceedings of the 23rd ACM Conference on Economics and Computation, pp. 404\u2013434 (2022)","DOI":"10.1145\/3490486.3538321"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39344-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:28:50Z","timestamp":1692995330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39344-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031393433","9783031393440"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39344-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","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":"faw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.cis.um.edu.mo\/ijtcs2023\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"34","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":"21","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":"0","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":"62% - 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","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}