{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:15:47Z","timestamp":1743059747537,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819778003"},{"type":"electronic","value":"9789819778010"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-981-97-7801-0_20","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"233-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Fair and\u00a0Efficient Allocations of\u00a0Indivisible Chores"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Liu","sequence":"first","affiliation":[]},{"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Akrami, H., Chaudhury, B.R., Hoefer, M., Mehlhorn, K., Schmalhofer, M., et\u00a0al.: Maximizing nash social welfare in 2-value instances: delineating tractability (2022)","DOI":"10.1609\/aaai.v36i5.20402"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of indivisible goods and chores. Auton. Agents Multi-Agent Syst. 36 (2019)","DOI":"10.1007\/s10458-021-09532-8"},{"key":"20_CR3","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. ACM SIGecom Exchanges 20, 24\u201340 (2022)","journal-title":"ACM SIGecom Exchanges"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.orl.2020.07.005","volume":"48","author":"H Aziz","year":"2019","unstructured":"Aziz, H., Moulin, H., Sandomirskiy, F.: A polynomial-time algorithm for computing a pareto optimal and almost proportional allocation. Oper. Res. Lett. 48, 573\u2013578 (2019)","journal-title":"Oper. Res. Lett."},{"key":"20_CR5","unstructured":"Barman, S., Khan, A., Shyam, S., Sreenivas, K.V.N.: Finding fair allocations under budget constraints. ArXiv arxiv:2208.08168 (2022)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K.: On the proximity of markets with integral equilibria. In: AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v33i01.33011748"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Barman, S., Murthy, S.K.K., Vaish, R.: Finding fair and efficient allocations, pp. 557\u2013574. arxiv:1707.04731 (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2010","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119, 1061\u20131103 (2010)","journal-title":"J. Polit. Econ."},{"key":"20_CR9","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. (TEAC) 7, 1\u201332 (2019)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Darmann, A., Schauer, J.: Maximizing nash product social welfare in allocating indivisible goods. ERN: Consumption (2014)","DOI":"10.2139\/ssrn.2410766"},{"key":"20_CR11","unstructured":"Ebadian, S., Peters, D., Shah, N.: How to fairly allocate easy and difficult chores. In: Adaptive Agents and Multi-Agent Systems (2021)"},{"key":"20_CR12","unstructured":"Foley, D.K.: Resource allocation and the public sector (1967). https:\/\/api.semanticscholar.org\/CorpusID:166802358"},{"key":"20_CR13","unstructured":"Garg, J., Murhekar, A., Qin, J.: Fair and efficient allocations of chores under bivalued preferences. ArXiv arxiv:2110.09601 (2021)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"de\u00a0Keijzer, B., Bouveret, S., Klos, T., Zhang, Y.: On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In: Algorithmic Decision Theory (2009)","DOI":"10.1007\/978-3-642-04428-1_9"},{"key":"20_CR15","unstructured":"Lee, E.: Apx-hardness of maximizing nash social welfare with indivisible items. ArXiv arxiv:1507.01159 (2015)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E.K., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: ACM Conference on Economics and Computation (2004)","DOI":"10.1145\/988772.988792"},{"key":"20_CR17","unstructured":"Mishra, S., Padala, M., Gujar, S.: Fair allocation of goods and chores - tutorial and survey of recent results. ArXiv arxiv:2307.10985 (2023)"},{"key":"20_CR18","unstructured":"Murhekar, A., Garg, J.: On fair and efficient allocations of indivisible goods. ArXiv arxiv:2204.14229 (2021)"},{"key":"20_CR19","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16(1) (1948)"},{"key":"20_CR20","unstructured":"Tao, B., Wu, X., Yu, Z., Zhou, S.: On the existence of efx (and pareto-optimal) allocations for binary chores. ArXiv arxiv:2308.12177 (2023)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Wu, X., Zhang, C., Zhou, S.: Weighted ef1 allocations for indivisible chores. Proceedings of the 24th ACM Conference on Economics and Computation (2023)","DOI":"10.1145\/3580507.3597763"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7801-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:09:06Z","timestamp":1726769346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7801-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819778003","9789819778010"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7801-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}