{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:15:10Z","timestamp":1743095710845,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710322"},{"type":"electronic","value":"9783031710339"}],"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-3-031-71033-9_4","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:17Z","timestamp":1725321737000},"page":"55-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair Division of\u00a0Chores with\u00a0Budget Constraints"],"prefix":"10.1007","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[]},{"given":"Ayumi","family":"Igarashi","sequence":"additional","affiliation":[]},{"given":"Nicholas","family":"Teh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Airiau, S., Gilbert, H., Grandi, U., Lang, J., Wilczynski, A.: Fair rent division on a budget revisited. In: Proceedings of the 26th European Conference on Artificial Intelligence (ECAI), pp. 52\u201359 (2023)","DOI":"10.3233\/FAIA230253"},{"key":"4_CR2","doi-asserted-by":"publisher","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":"4_CR3","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(1), 3:1\u20133:21 (2022)","DOI":"10.1007\/s10458-021-09532-8"},{"issue":"1","key":"4_CR4","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 Exchanges 20(1), 24\u201340 (2022)","journal-title":"SIGecom Exchanges"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Barman, S., Khan, A., Shyam, S., Sreenivas, K.V.N.: Guaranteeing envy-freeness under generalized assignment constraints. In: Proceedings of the 24th ACM Conference on Economics and Computation (EC), pp. 242\u2013269 (2023)","DOI":"10.1145\/3580507.3597698"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Barman, S., Khan, A., Shyam, S., Sreenivas, K.: Finding fair allocations under budget constraints. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI), pp. 5481\u20135489 (2023)","DOI":"10.1609\/aaai.v37i5.25681"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Barman, S., Sundaram, R.G.: Uniform welfare guarantees under identical subadditive valuations. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pp. 46\u201352 (2020)","DOI":"10.24963\/ijcai.2020\/7"},{"issue":"6","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1847","DOI":"10.3982\/ECTA14564","volume":"85","author":"A Bogomolnaia","year":"2017","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskiy, F., Yanovskaya, E.: Competitive division of a mixed manna. Econometrica 85(6), 1847\u20131871 (2017)","journal-title":"Econometrica"},{"key":"4_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)"},{"issue":"6","key":"4_CR10","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."},{"key":"4_CR11","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"},{"issue":"4","key":"4_CR12","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."},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713\u2013728 (2005)","journal-title":"SIAM J. Comput."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Dehghani, S., Farhadi, A., HajiAghayi, M., Yami, H.: Envy-free chore division for an arbitrary number of agents. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2564\u20132583 (2018)","DOI":"10.1137\/1.9781611975031.164"},{"key":"4_CR15","unstructured":"Gan, J., Li, B., Wu, X.: Approximation algorithm for computing budget-feasible EF1 allocations. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 170\u2013178 (2023)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Garbea, M., Gkatzelis, V., Tan, X.: EFx budget-feasible allocations with high Nash welfare. In: Proceedings of the 26th European Conference on Artificial Intelligence (ECAI), pp. 795\u2013802 (2023)","DOI":"10.3233\/FAIA230346"},{"key":"4_CR17","unstructured":"Ghosal, P., Vishwa Prakash, H.V., Nimbhorkar, P., Varma, N.: EFX exists for four agents with three types of valuations. arXiv preprint arXiv:2301.10632 (2023)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Lackner, M., Nardi, O., Novaro, A.: Repeated fair allocation of indivisible items. In: Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI), pp. 9781\u20139789 (2024)","DOI":"10.1609\/aaai.v38i9.28837"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Yokoyama, T.: Kajibuntan: a house chore division app. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI), pp. 16449\u201316451 (2023)","DOI":"10.1609\/aaai.v37i13.27075"},{"key":"4_CR20","unstructured":"Mutzari, D., Aumann, Y., Kraus, S.: Resilient fair allocation of indivisible goods. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 2688\u20132690 (2023)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2584\u20132603 (2018)","DOI":"10.1137\/1.9781611975031.165"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Procaccia, A., Velez, R., Yu, D.: Fair rent division on a budget. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI), pp. 1177\u20131184 (2018)","DOI":"10.1609\/aaai.v32i1.11465"},{"issue":"1","key":"4_CR23","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":"4_CR24","doi-asserted-by":"crossref","unstructured":"Wu, X., Li, B., Gan, J.: Budget-feasible maximum Nash social welfare is almost envy-free. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), pp. 465\u2013471 (2021)","DOI":"10.24963\/ijcai.2021\/65"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71033-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:48Z","timestamp":1725321768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71033-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710322","9783031710339"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9_4","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":"31 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cwi.nl\/en\/groups\/networks-and-optimization\/events\/sagt-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}