{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:10:04Z","timestamp":1743156604808,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"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_5","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"77-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fair Division with\u00a0Allocator\u2019s Preference"],"prefix":"10.1007","author":[{"given":"Xiaolin","family":"Bu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengxin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxin","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Biaoshuai","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., et al.: Fair division of indivisible goods: recent progress and open questions. Artif. Intell. 103965 (2023)","DOI":"10.1016\/j.artint.2023.103965"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H.: Developments in multi-agent fair allocation. In: AAAI, pp. 13563\u201313568 (2020)","DOI":"10.1609\/aaai.v34i09.7082"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.ejor.2022.10.013","volume":"307","author":"H Aziz","year":"2023","unstructured":"Aziz, H., Huang, X., Mattei, N., Segal-Halevi, E.: Computing welfare-maximizing fair allocations of indivisible goods. Eur. J. Oper. Res. 307(2), 773\u2013784 (2023)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.orl.2020.07.005","volume":"48","author":"H Aziz","year":"2020","unstructured":"Aziz, H., Moulin, H., Sandomirskiy, F.: A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Oper. Res. Lett. 48(5), 573\u2013578 (2020)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0097-3165(78)90023-7","volume":"25","author":"I B\u00e1r\u00e1ny","year":"1978","unstructured":"B\u00e1r\u00e1ny, I.: A short proof of Kneser\u2019s conjecture. J. Combin. Theory Ser. A 25(3), 325\u2013326 (1978)","journal-title":"J. Combin. Theory Ser. A"},{"key":"5_CR6","unstructured":"Barman, S., Ghalme, G., Jain, S., Kulkarni, P., Narang, S.: Fair division of indivisible goods among strategic agents. In: AAMAS, pp. 1811\u20131813 (2019)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K.: On the proximity of markets with integral equilibria. In: AAAI, pp. 1748\u20131755 (2019)","DOI":"10.1609\/aaai.v33i01.33011748"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Feldman, M., Lai, J.K., Morgenstern, J., Procaccia, A.D.: On maxsum fair cake divisions. In: AAAI, pp. 1285\u20131291 (2012)","DOI":"10.1609\/aaai.v26i1.8237"},{"issue":"1","key":"5_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(1), 9\u201318 (1995)","journal-title":"Am. Math. Mon."},{"key":"5_CR10","unstructured":"Bu, X., Li, Z., Liu, S., Song, J., Tao, B.: On the complexity of maximizing social welfare within fair allocations of indivisible goods. arXiv preprint arXiv:2205.14296 (2022)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Bu, X., Li, Z., Liu, S., Song, J., Tao, B.: Fair division with allocator\u2019s preference. arXiv preprint arXiv:2310.03475 (2023)","DOI":"10.1007\/978-3-031-48974-7_5"},{"issue":"6","key":"5_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(6), 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/opre.2016.1544","volume":"65","author":"E Budish","year":"2017","unstructured":"Budish, E., Cachon, G.P., Kessler, J.B., Othman, A.: Course match: a large-scale implementation of approximate competitive equilibrium from equal incomes for combinatorial allocation. Oper. Res. 65(2), 314\u2013336 (2017)","journal-title":"Oper. Res."},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3355902","volume":"7","author":"I Caragiannis","year":"2019","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. ACM Trans. Econ. Comput. 7(3), 1\u201332 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Cohler, Y.J., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Optimal envy-free cake cutting. In: AAAI, pp. 626\u2013631 (2011)","DOI":"10.1609\/aaai.v25i1.7874"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Freeman, R., Shah, N.: Fair public decision making. In: EC, pp. 629\u2013646 (2017)","DOI":"10.1145\/3033274.3085125"},{"issue":"3","key":"5_CR17","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":"5_CR18","first-page":"45","volume":"7","author":"DK Foley","year":"1967","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale Econ. Essays 7(1), 45\u201398 (1967)","journal-title":"Yale Econ. Essays"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Freeman, R., Micha, E., Shah, N.: Two-sided matching meets fair division. In: IJCAI, pp. 203\u2013209 (2021)","DOI":"10.24963\/ijcai.2021\/29"},{"issue":"2","key":"5_CR20","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":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-64946-3_1","volume-title":"Web and Internet Economics","author":"S Gollapudi","year":"2020","unstructured":"Gollapudi, S., Kollias, K., Plaut, B.: Almost envy-free repeated matching in\u00a0two-sided markets. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 3\u201316. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_1"},{"issue":"10","key":"5_CR22","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1080\/00029890.2002.11919930","volume":"109","author":"JE Greene","year":"2002","unstructured":"Greene, J.E.: A new short proof of Kneser\u2019s conjecture. Am. Math. Mon. 109(10), 918\u2013920 (2002)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"5_CR23","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."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-68279-0_3","volume-title":"50 Years of Integer Programming 1958-2008","author":"AJ Hoffman","year":"2010","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958-2008, pp. 49\u201376. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_3"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Kawase, Y., Suksompong, W., Sumita, H.: Fair division with two-sided preferences. In: IJCAI, pp. 2756\u20132764 (2023)","DOI":"10.24963\/ijcai.2023\/307"},{"issue":"2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"111682","DOI":"10.1016\/j.disc.2019.111682","volume":"343","author":"A Jafari","year":"2020","unstructured":"Jafari, A., Moghaddamzadeh, M.J.: On the chromatic number of generalized Kneser graphs and Hadamard matrices. Discret. Math. 343(2), 111682 (2020)","journal-title":"Discret. Math."},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2020.07.008","volume":"841","author":"M Kyropoulou","year":"2020","unstructured":"Kyropoulou, M., Suksompong, W., Voudouris, A.A.: Almost envy-freeness in group resource allocation. Theoret. Comput. Sci. 841, 110\u2013123 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: EC, pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Liu, S., Lu, X., Suzuki, M., Walsh, T.: Mixed fair division: A survey. arXiv preprint arXiv:2306.09564 (2023)","DOI":"10.1613\/jair.1.15800"},{"issue":"3","key":"5_CR30","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L.: Kneser\u2019s conjecture, chromatic number, and homotopy. J. Combin. Theory Ser. A 25(3), 319\u2013324 (1978)","journal-title":"J. Combin. Theory Ser. A"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.mathsocsci.2017.05.006","volume":"89","author":"P Manurangsi","year":"2017","unstructured":"Manurangsi, P., Suksompong, W.: Asymptotic existence of fair divisions for groups. Math. Soc. Sci. 89, 100\u2013108 (2017)","journal-title":"Math. Soc. Sci."},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.tcs.2022.07.022","volume":"930","author":"P Manurangsi","year":"2022","unstructured":"Manurangsi, P., Suksompong, W.: Almost envy-freeness for groups: Improved bounds via discrepancy theory. Theoret. Comput. Sci. 930, 179\u2013195 (2022)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR33","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00493-004-0011-1","volume":"24","author":"J Matou\u0161ek","year":"2004","unstructured":"Matou\u0161ek, J.: A combinatorial proof of Kneser\u2019s conjecture. Combinatorica 24(1), 163\u2013170 (2004)","journal-title":"Combinatorica"},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1613\/jair.1.11618","volume":"68","author":"P McGlaughlin","year":"2020","unstructured":"McGlaughlin, P., Garg, J.: Improving Nash social welfare approximations. J. Artif. Intell. Res. 68, 225\u2013245 (2020)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"5_CR35","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1146\/annurev-economics-080218-025559","volume":"11","author":"H Moulin","year":"2019","unstructured":"Moulin, H.: Fair division in the Internet age. Annu. Rev. Econ. 11(1), 407\u2013441 (2019)","journal-title":"Annu. Rev. Econ."},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Patro, G.K., Biswas, A., Ganguly, N., Gummadi, K.P., Chakraborty, A.: FairRec: two-sided fairness for personalized recommendations in two-sided platforms. In: WWW, pp. 1194\u20131204 (2020)","DOI":"10.1145\/3366423.3380196"},{"issue":"7","key":"5_CR37","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(7), 78\u201387 (2013)","journal-title":"Commun. ACM"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Robertson, J., Webb, W.: Cake-Cutting Algorithm: Be Fair If You Can. A K Peters\/CRC Press (1998)","DOI":"10.1201\/9781439863855"},{"issue":"4","key":"5_CR39","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s00355-019-01210-9","volume":"53","author":"E Segal-Halevi","year":"2019","unstructured":"Segal-Halevi, E., Nitzan, S.: Fair cake-cutting among families. Soc. Choice Welfare 53(4), 709\u2013740 (2019)","journal-title":"Soc. Choice Welfare"},{"key":"5_CR40","doi-asserted-by":"publisher","first-page":"103167","DOI":"10.1016\/j.artint.2019.103167","volume":"277","author":"E Segal-Halevi","year":"2019","unstructured":"Segal-Halevi, E., Suksompong, W.: Democratic fair allocation of indivisible goods. Artif. Intell. 277, 103167 (2019)","journal-title":"Artif. Intell."},{"issue":"1","key":"5_CR41","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"},{"key":"5_CR42","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"},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.mathsocsci.2017.09.004","volume":"92","author":"W Suksompong","year":"2018","unstructured":"Suksompong, W.: Approximate maximin shares for groups of agents. Math. Soc. Sci. 92, 40\u201347 (2018)","journal-title":"Math. Soc. Sci."},{"issue":"2","key":"5_CR44","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/3505156.3505162","volume":"19","author":"W Suksompong","year":"2021","unstructured":"Suksompong, W.: Constraints in fair division. ACM SIGecom Exchanges 19(2), 46\u201361 (2021)","journal-title":"ACM SIGecom Exchanges"},{"issue":"1","key":"5_CR45","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H.R.: Equity, envy, and efficiency. J. Econ. Theory 9(1), 63\u201391 (1974)","journal-title":"J. Econ. Theory"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T03:49:13Z","timestamp":1730951353000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_5","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)"}}]}}