{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:40:08Z","timestamp":1767318008527,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819548385","type":"print"},{"value":"9789819548392","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-4839-2_4","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:36:35Z","timestamp":1767317795000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate EFX and\u00a0Efficient Allocations of\u00a0Chores for\u00a0Bounded Preferences"],"prefix":"10.1007","author":[{"given":"Hui","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhijie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Filos-Ratsikas, A., Sgouritsa, A.: Pushing the frontier on approximate EFX allocations. In: Proceedings of the 25th ACM Conference on Economics and Computation, EC 2024, New Haven, CT, USA, 8\u201311 July 2024, pp. 1268\u20131286. ACM (2024)","DOI":"10.1145\/3670865.3673582"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Markakis, E., Ntokos, A.: Multiple birds with one stone: beating 1\/2 for EFX and GMMS via envy cycle elimination. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, New York, NY, USA, 7\u201312 February 2020, pp. 1790\u20131797. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5545"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of indivisible goods and chores. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, 10\u201316 August 2019, pp. 53\u201359. ijcai.org (2019)","DOI":"10.24963\/ijcai.2019\/8"},{"key":"4_CR4","unstructured":"Bhaskar, U., Sricharan, A.R., Vaish, R.: On approximate envy-freeness for indivisible chores and mixed resources. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2021, 16\u201318 August 2021, University of Washington, Seattle, Washington, USA (Virtual Conference). LIPIcs, vol.\u00a0207, pp. 1:1\u20131:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"4_CR5","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. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, Maastricht, The Netherlands, 24\u201328 July 2016, pp. 305\u2013322. ACM (2016)","DOI":"10.1145\/2940716.2940726"},{"key":"4_CR6","unstructured":"Chakraborty, M., Igarashi, A., Suksompong, W., Zick, Y.: Weighted envy-freeness in indivisible item allocation. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020, Auckland, New Zealand, 9\u201313 May 2020, pp. 231\u2013239. IFAAMAS (2020)"},{"key":"4_CR7","unstructured":"Ebadian, S., Peters, D., Shah, N.: How to fairly allocate easy and difficult chores. In: 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zealand, 9\u201313 May 2022, pp. 372\u2013380. IFAAMAS (2022)"},{"key":"4_CR8","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale University (1966)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Garg, J., Murhekar, A., Qin, J.: Fair and efficient allocations of chores under bivalued preferences. In: Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual Event, 22 February\u20131 March 2022, pp. 5043\u20135050. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i5.20436"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Garg, J., Murhekar, A., Qin, J.: Constant-factor EFX exists for chores. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czechia, 23\u201327 June 2025, pp. 1580\u20131589. ACM (2025)","DOI":"10.1145\/3717823.3718305"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Li, B., Li, Y., Wu, X.: Almost (weighted) proportional allocations for indivisible chores. In: WWW 2022: The ACM Web Conference 2022, Virtual Event, Lyon, France, 25\u201329 April 2022, pp. 122\u2013131. ACM (2022)","DOI":"10.1145\/3485447.3512057"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), New York, NY, USA, 17\u201320 May 2004, pp. 125\u2013131. ACM (2004)","DOI":"10.1145\/988772.988792"},{"key":"4_CR13","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic theory. OUP Catalogue (1995)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Murhekar, A., Garg, J.: On fair and efficient allocations of indivisible goods. In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, 2\u20139 February 2021, pp. 5595\u20135602. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i6.16703"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Neoh, T.Y., Teh, N.: Understanding EFX allocations: counting and variants. In: AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, 25 February\u20134 March 2025, Philadelphia, PA, USA, pp. 14036\u201314044. AAAI Press (2025)","DOI":"10.1609\/aaai.v39i13.33536"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 2584\u20132603. SIAM (2018)","DOI":"10.1137\/1.9781611975031.165"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Springer, M., Hajiaghayi, M., Yami, H.: Almost envy-free allocations of indivisible goods or chores with entitlements. In: Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, 20\u201327 February 2024, Vancouver, Canada, pp. 9901\u20139908. AAAI Press (2024)","DOI":"10.1609\/aaai.v38i9.28851"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Wu, X., Zhang, C., Zhou, S.: Weighted EF1 allocations for indivisible chores. In: Proceedings of the 24th ACM Conference on Economics and Computation, EC 2023, London, United Kingdom, 9\u201312 July 2023, p.\u00a01155. ACM (2023)","DOI":"10.1145\/3580507.3597763"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Zhou, S., Wu, X.: Approximately EFX allocations for indivisible chores. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23\u201329 July 2022, pp. 783\u2013789. ijcai.org (2022)","DOI":"10.24963\/ijcai.2022\/110"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4839-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:36:37Z","timestamp":1767317797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4839-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819548385","9789819548392"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4839-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","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":"tamc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.maths.sdnu.edu.cn\/TAMC2025.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}