{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T01:37:29Z","timestamp":1768700249016,"version":"3.49.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031489730","type":"print"},{"value":"9783031489747","type":"electronic"}],"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_33","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"582-599","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["One Quarter Each (on Average) Ensures Proportionality"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5766-2115","authenticated-orcid":false,"given":"Xiaowei","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0338-7162","authenticated-orcid":false,"given":"Cong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9739-1308","authenticated-orcid":false,"given":"Shengwei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Akrami, H., Alon, N., Chaudhury, B.R., Garg, J., Mehlhorn, K., Mehta, R.: EFX: a simpler approach and an (almost) optimal guarantee via rainbow cycle number. In: EC, p. 61. ACM (2023)","DOI":"10.1145\/3580507.3597799"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"103965","DOI":"10.1016\/j.artint.2023.103965","volume":"322","author":"G Amanatidis","year":"2023","unstructured":"Amanatidis, G., et al.: Fair division of indivisible goods: recent progress and open questions. Artif. Intell. 322, 103965 (2023)","journal-title":"Artif. Intell."},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2021.02.020","volume":"863","author":"G Amanatidis","year":"2021","unstructured":"Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., Voudouris, A.A.: Maximum nash welfare and other stories about EFX. Theor. Comput. Sci. 863, 69\u201385 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF00179981","volume":"12","author":"E Aragones","year":"1995","unstructured":"Aragones, E.: A derivation of the money rawlsian solution. Soc. Choice Welfare 12, 267\u2013276 (1995)","journal-title":"Soc. Choice Welfare"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H.: Achieving envy-freeness and equitability with monetary transfers. In: AAAI, pp. 5102\u20135109. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i6.16645"},{"issue":"1","key":"33_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10458-021-09532-8","volume":"36","author":"H Aziz","year":"2022","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of indivisible goods and chores. Auton. Agents Multi Agent Syst. 36(1), 3 (2022)","journal-title":"Auton. Agents Multi Agent Syst."},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/3572885.3572887","volume":"20","author":"H Aziz","year":"2022","unstructured":"Aziz, H., Li, B., Moulin, H., Wu, X.: Algorithmic fair allocation of indivisible items: a survey and new questions. SIGecom Exch. 20(1), 24\u201340 (2022)","journal-title":"SIGecom Exch."},{"key":"33_CR8","unstructured":"Aziz, H., Lindsay, J., Ritossa, A., Suzuki, M.: Fair allocation of two types of chores. In: AAMAS, pp. 143\u2013151. ACM (2023)"},{"issue":"5","key":"33_CR9","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."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishna, A., Narahari, Y., Sadhukhan, S.: Achieving envy-freeness with limited subsidies under dichotomous valuations. In: IJCAI, pp. 60\u201366. ijcai.org (2022)","DOI":"10.24963\/ijcai.2022\/9"},{"key":"33_CR11","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":"33_CR12","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K.: Approximation algorithms for maximin fair division. ACM Trans. Econ. Comput. 8(1), 5:1\u20135:28 (2020)","DOI":"10.1145\/3381525"},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"103436","DOI":"10.1016\/j.artint.2020.103436","volume":"293","author":"X Bei","year":"2021","unstructured":"Bei, X., Li, Z., Liu, J., Liu, S., Lu, X.: Fair division of mixed divisible and indivisible goods. Artif. Intell. 293, 103436 (2021)","journal-title":"Artif. Intell."},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Berger, B., Cohen, A., Feldman, M., Fiat, A.: Almost full EFX exists for four agents. In: AAAI, pp. 4826\u20134833. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i5.20410"},{"key":"33_CR15","unstructured":"Bhaskar, U., Sricharan, A.R., Vaish, R.: On approximate envy-freeness for indivisible chores and mixed resources. In: APPROX-RANDOM. LIPIcs, vol. 207, pp. 1:1\u20131:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"2","key":"33_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10458-015-9287-3","volume":"30","author":"S Bouveret","year":"2016","unstructured":"Bouveret, S., Lema\u00eetre, M.: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton. Agents Multi Agent Syst. 30(2), 259\u2013290 (2016)","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"33_CR17","unstructured":"Br\u00e2nzei, S., Sandomirskiy, F.: Algorithms for competitive division of chores. CoRR abs\/1907.01766 (2019)"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Brustle, J., Dippel, J., Narayan, V.V., Suzuki, M., Vetta, A.: One dollar each eliminates envy. In: EC, pp. 23\u201339. ACM (2020)","DOI":"10.1145\/3391403.3399447"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. In: BQGT, p. 74:1. ACM (2010)","DOI":"10.1145\/1807406.1807480"},{"key":"33_CR20","unstructured":"Caragiannis, I., Fanelli, A.: On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. In: ICALP. LIPIcs, vol. 132, pp. 133:1\u2013133:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"33_CR21","doi-asserted-by":"crossref","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), 12:1\u201312:32 (2019)","DOI":"10.1145\/3355902"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. In: EC, pp. 1\u201319. ACM (2020)","DOI":"10.1145\/3391403.3399511"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K., Mehta, R., Misra, P.: Improving EFX guarantees through rainbow cycle number. In: EC, pp. 310\u2013311. ACM (2021)","DOI":"10.1145\/3465456.3467605"},{"issue":"4","key":"33_CR24","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1137\/20M1359134","volume":"50","author":"BR Chaudhury","year":"2021","unstructured":"Chaudhury, B.R., Kavitha, T., Mehlhorn, K., Sgouritsa, A.: A little charity guarantees almost envy-freeness. SIAM J. Comput. 50(4), 1336\u20131358 (2021)","journal-title":"SIAM J. Comput."},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Freeman, R., Shah, N.: Fair public decision making. In: EC (2017)","DOI":"10.1145\/3033274.3085125"},{"issue":"10","key":"33_CR26","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1080\/00029890.1999.12005142","volume":"106","author":"SF Edward","year":"1999","unstructured":"Edward, S.F.: Rental harmony: Sperner\u2019s lemma in fair division. Am. Math. Mon. 106(10), 930\u2013942 (1999)","journal-title":"Am. Math. Mon."},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Feldman, M., Mauras, S., Ponitka, T.: On optimal tradeoffs between EFX and nash welfare. arXiv preprint arXiv:2302.09633 (2023)","DOI":"10.1609\/aaai.v38i9.28826"},{"key":"33_CR28","unstructured":"Foley, D.: Resource allocation and the public sector. Yale Economic Essays, pp. 45\u201398 (1967)"},{"key":"33_CR29","doi-asserted-by":"crossref","unstructured":"Gal, Y.K., Mash, M., Procaccia, A.D., Zick, Y.: Which is the fairest (rent division) of them all? J. ACM 64(6), 39:1\u201339:22 (2017)","DOI":"10.1145\/3131361"},{"key":"33_CR30","doi-asserted-by":"crossref","unstructured":"Goko, H., et al.: Fair and truthful mechanism with limited subsidy. In: AAMAS. pp. 534\u2013542. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) (2022)","DOI":"10.2139\/ssrn.4100937"},{"key":"33_CR31","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s003550100149","volume":"19","author":"CJ Haake","year":"2002","unstructured":"Haake, C.J., Raith, M.G., Su, F.E.: Bidding for envy-freeness: a procedural approach to n-player fair-division problems. Soc. Choice Welfare 19, 723\u2013749 (2002)","journal-title":"Soc. Choice Welfare"},{"key":"33_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-030-30473-7_25","volume-title":"Algorithmic Game Theory","author":"D Halpern","year":"2019","unstructured":"Halpern, D., Shah, N.: Fair division with subsidy. In: Fotakis, D., Markakis, E. (eds.) SAGT 2019. LNCS, vol. 11801, pp. 374\u2013389. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30473-7_25"},{"key":"33_CR33","doi-asserted-by":"crossref","unstructured":"Huang, X., Lu, P.: An algorithmic framework for approximating maximin share allocation of chores. In: EC, pp. 630\u2013631. ACM (2021)","DOI":"10.1145\/3465456.3467555"},{"key":"33_CR34","doi-asserted-by":"crossref","unstructured":"Huang, X., Segal-Halevi, E.: A reduction from chores allocation to job scheduling. In: EC, p. 908. ACM (2023)","DOI":"10.1145\/3580507.3597676"},{"issue":"2","key":"33_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s003550050015","volume":"17","author":"F Klijn","year":"2000","unstructured":"Klijn, F.: An algorithm for envy-free allocations in an economy with indivisible objects and money. Soc. Choice Welfare 17(2), 201\u2013215 (2000)","journal-title":"Soc. Choice Welfare"},{"key":"33_CR36","doi-asserted-by":"crossref","unstructured":"Li, B., Li, Y., Wu, X.: Almost (weighted) proportional allocations for indivisible chores. In: WWW, pp. 122\u2013131. ACM (2022)","DOI":"10.1145\/3485447.3512057"},{"key":"33_CR37","doi-asserted-by":"crossref","unstructured":"Li, Z., Liu, S., Lu, X., Tao, B.: Truthful fair mechanisms for allocating mixed divisible and indivisible goods. In: IJCAI, pp. 2808\u20132816. ijcai.org (2023)","DOI":"10.24963\/ijcai.2023\/313"},{"key":"33_CR38","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: EC, pp. 125\u2013131. ACM (2004)","DOI":"10.1145\/988772.988792"},{"key":"33_CR39","unstructured":"Liu, S., Lu, X., Suzuki, M., Walsh, T.: Mixed fair division: A survey. CoRR abs\/2306.09564 (2023)"},{"key":"33_CR40","doi-asserted-by":"publisher","unstructured":"Maskin, E.S.: On the fair allocation of indivisible goods. In: Arrow and the Foundations of the Theory of Economic Policy, pp. 341\u2013349. Springer (1987). https:\/\/doi.org\/10.1007\/978-1-349-07357-3_12","DOI":"10.1007\/978-1-349-07357-3_12"},{"issue":"3","key":"33_CR41","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0165-4896(02)00064-1","volume":"44","author":"M Meertens","year":"2002","unstructured":"Meertens, M., Potters, J., Reijnierse, H.: Envy-free and pareto efficient allocations in economies with indivisible goods and money. Math. Soc. Sci. 44(3), 223\u2013233 (2002)","journal-title":"Math. Soc. Sci."},{"key":"33_CR42","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1146\/annurev-economics-080218-025559","volume":"11","author":"H Moulin","year":"2018","unstructured":"Moulin, H.: Fair division in the age of internet. Annu. Rev. Econ. 11, 407\u2013441 (2018)","journal-title":"Annu. Rev. Econ."},{"key":"33_CR43","unstructured":"Peters, D., Procaccia, A.D., Zhu, D.: Robust rent division. In: NeurIPS (2022)"},{"issue":"2","key":"33_CR44","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/19M124397X","volume":"34","author":"B Plaut","year":"2020","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. SIAM J. Discret. Math. 34(2), 1039\u20131068 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"33_CR45","first-page":"101","volume":"16","author":"H Steihaus","year":"1948","unstructured":"Steihaus, H.: The problem of fair division. Econometrica 16, 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"33_CR46","unstructured":"Yin, L., Mehta, R.: On the envy-free allocation of chores. CoRR abs\/2211.15836 (2022)"},{"key":"33_CR47","doi-asserted-by":"crossref","unstructured":"Zhou, S., Wu, X.: Approximately EFX allocations for indivisible chores. In: IJCAI, pp. 783\u2013789. ijcai.org (2022)","DOI":"10.24963\/ijcai.2022\/110"}],"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_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T03:50:19Z","timestamp":1730951419000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}