{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:07:15Z","timestamp":1743080835968,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489730"},{"type":"electronic","value":"9783031489747"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_18","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"310-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Discrete and\u00a0Bounded Locally Envy-Free Cake Cutting Protocol on\u00a0Trees"],"prefix":"10.1007","author":[{"given":"Ganesh","family":"Ghalme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuka","family":"Machino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nidhi","family":"Rathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"18_CR1","unstructured":"Abebe, R., Kleinberg, J., Parkes, D.C.: Fair division via social comparison. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems (AAMAS), pp. 281\u2013289 (2017)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-99660-8_9","volume-title":"Algorithmic Game Theory","author":"G Amanatidis","year":"2018","unstructured":"Amanatidis, G., Christodoulou, G., Fearnley, J., Markakis, E., Psomas, C.-A., Vakaliou, E.: An improved envy-free cake cutting protocol for four agents. In: Deng, X. (ed.) SAGT 2018. LNCS, vol. 11059, pp. 87\u201399. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99660-8_9"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-35389-6_5","volume-title":"Web and Internet Economics","author":"ER Arunachaleswaran","year":"2019","unstructured":"Arunachaleswaran, E.R., Barman, S., Kumar, R., Rathi, N.: Fair and efficient cake division with connected pieces. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 57\u201370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_5"},{"key":"18_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 Annual Symposium on Foundations of Computer Science (FOCS), pp. 416\u2013427 (2016)","DOI":"10.1109\/FOCS.2016.52"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for four agents. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing, pp. 454\u2013464. (STOC) (2016)","DOI":"10.1145\/2897518.2897522"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Barman, S., Rathi, N.: Fair cake division under monotone likelihood ratios. In: Mathematics of Operations Research, pp. 1875\u20131903 (2022)","DOI":"10.1287\/moor.2021.1192"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bei, X., Qiao, Y., Zhang, S.: Networked fairness in cake cutting. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, (IJCAI), pp. 3632\u20133638 (2017)","DOI":"10.24963\/ijcai.2017\/508"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Bei, X., Sun, X., Wu, H., Zhang, J., Zhang, Z., Zi, W.: Cake cutting on graphs: a discrete and bounded proportional protocol. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2114\u20132123 (2020)","DOI":"10.1137\/1.9781611975994.130"},{"key":"18_CR9","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)"},{"key":"18_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"103664","DOI":"10.1016\/j.artint.2022.103664","volume":"305","author":"R Bredereck","year":"2022","unstructured":"Bredereck, R., Kaczmarczyk, A., Niedermeier, R.: Envy-free allocations respecting social networks. Artif. Intell. 305, 103664 (2022)","journal-title":"Artif. Intell."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119, 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"issue":"6","key":"18_CR13","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."},{"issue":"1P1","key":"18_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"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Edward Su, F.: Rental harmony: Sperner\u2019s lemma in fair division. Am. Math. Monthly 106(10), 930\u2013942 (1999)","DOI":"10.1080\/00029890.1999.12005142"},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/JSAC.2007.070402","volume":"25","author":"R Etkin","year":"2007","unstructured":"Etkin, R., Parekh, A., Tse, D.: Spectrum sharing for unlicensed bands. IEEE J. Sel. Areas Commun. 25(3), 517\u2013528 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"18_CR17","unstructured":"Foley, D.K.: Resource Allocation and the Public Sector, vol. 7:45\u201398. Yale Economic Essays (1966)"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Ghalme, G., Huang, X., Machino, Y., Rathi, N.: A discrete and bounded locally envy-free cake cutting protocol on trees. arXiv preprint arXiv:2211.06458 (2022)","DOI":"10.1007\/978-3-031-48974-7_18"},{"issue":"2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/2728732.2728738","volume":"13","author":"J Goldman","year":"2015","unstructured":"Goldman, J., Procaccia, A.D.: Spliddit: unleashing fair division algorithms. ACM SIGecom Exchanges 13(2), 41\u201346 (2015)","journal-title":"ACM SIGecom Exchanges"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Lai, J., Procaccia, A.: How to cut a cake before the party ends. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 555\u2013561 (2013)","DOI":"10.1609\/aaai.v27i1.8629"},{"key":"18_CR21","volume-title":"Fair Division and Collective Welfare","author":"H Moulin","year":"2004","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT press, Cambridge (2004)"},{"key":"18_CR22","unstructured":"Procaccia, A.D.: Thou shalt covet thy neighbor\u2019s cake. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), pp. 239\u2013244 (2009)"},{"key":"18_CR23","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855","volume-title":"Cake-Cutting Algorithms: Be Fair if You Can","author":"J Robertson","year":"1998","unstructured":"Robertson, J., Webb, W.: Cake-Cutting Algorithms: Be Fair if You Can. AK Peters\/CRC Press, Natick (1998)"},{"key":"18_CR24","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"},{"issue":"8","key":"18_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."},{"issue":"1","key":"18_CR26","doi-asserted-by":"publisher","first-page":"R11","DOI":"10.37236\/735","volume":"15","author":"W Stromquist","year":"2008","unstructured":"Stromquist, W.: Envy-free cake divisions cannot be found by finite protocols. Electron. J. Combinatorics 15(1), R11 (2008)","journal-title":"Electron. J. Combinatorics"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"106341","DOI":"10.1016\/j.ipl.2022.106341","volume":"180","author":"J Tucker-Foltz","year":"2023","unstructured":"Tucker-Foltz, J.: Thou shalt covet the average of thy neighbors\u2019 cakes. Inf. Process. Lett. 180, 106341 (2023)","journal-title":"Inf. Process. Lett."}],"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-031-48974-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:04:37Z","timestamp":1703988277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","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":"Shanghai","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":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","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":"221","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":"37","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":"17% - 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":"8","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)"}},{"value":"29 one-page abstracts accepted","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)"}}]}}