{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:52:22Z","timestamp":1743065542964,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031432538"},{"type":"electronic","value":"9783031432545"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43254-5_13","type":"book-chapter","created":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:04:03Z","timestamp":1693782243000},"page":"221-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximin Fair Allocation of\u00a0Indivisible Items Under Cost Utilities"],"prefix":"10.1007","author":[{"given":"Sirin","family":"Botan","sequence":"first","affiliation":[]},{"given":"Angus","family":"Ritossa","sequence":"additional","affiliation":[]},{"given":"Mashbat","family":"Suzuki","sequence":"additional","affiliation":[]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,4]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Akrami, H., Rezvan, R., Seddighin, M.: An EF2X allocation protocol for restricted additive valuations. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI) (2022)","DOI":"10.24963\/ijcai.2022\/3"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Christodoulou, G., Markakis, E.: Truthful allocation mechanisms without payments: characterization and implications on fairness. In: Proceedings of the 18th ACM Conference on Economics and Computation (EC) (2017)","DOI":"10.1145\/3033274.3085147"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Voudouris, A.A.: Fair division of indivisible goods: a survey. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI) (2022)","DOI":"10.24963\/ijcai.2022\/756"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation algorithms for computing maximin share allocations. ACM Trans. Algorithms 13(4), 1\u201328 (2017b)","DOI":"10.1145\/3147173"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Feige, U., Saberi, A.: Santa Claus meets hypergraph matchings. ACM Trans. Algorithms 8(3), 1\u20139 (2012)","DOI":"10.1145\/2229163.2229168"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI) (2021)","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, p. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Cechl\u00e1rov\u00e1, K., Elkind, E., Igarashi, A., Peters, D.: Fair division of a graph. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI) (2017)","DOI":"10.24963\/ijcai.2017\/20"},{"issue":"2","key":"13_CR9","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":"13_CR10","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division: From cake-cutting to dispute resolution. Cambridge University Press (1996)","DOI":"10.1017\/CBO9780511598975"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"issue":"6","key":"13_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."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Camacho, F., Fonseca-Delgado, R., Pino P\u00e9rez, R., Tapia, G.: Generalized binary utility functions and fair allocations. Math. Soc. Sci. 121, 50\u201360 (2022)","DOI":"10.1016\/j.mathsocsci.2022.10.003"},{"key":"13_CR14","unstructured":"Cheng, S., Mao, Y.: Integrality gap of the configuration LP for the restricted max-min fair allocation (2018), http:\/\/arxiv.org\/abs\/1807.04152"},{"key":"13_CR15","unstructured":"Ebadian, S., Peters, D., Shah, N.: How to fairly allocate easy and difficult chores. In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2022)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Feige, U., Sapir, A., Tauber, L.: A tight negative example for MMS fair allocations. In: Proceedings of the 17th International Conference on Web and Internet Economics (WINE) (2021)","DOI":"10.1007\/978-3-030-94676-0_20"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Garg, J., Taki, S.: An improved approximation algorithm for maximin shares. In: Proceedings of the 21st ACM Conference on Economics and Computation (EC) (2020)","DOI":"10.1145\/3391403.3399526"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Ghodsi, M., Hajiaghayi, M., Seddighin, M., Seddighin, S., Yami, H.: Fair allocation of indivisible goods: Improvements and generalizations. In: Proceedings of the 19th ACM Conference on Economics and Computation (EC) (2018)","DOI":"10.1145\/3219166.3219238"},{"issue":"2","key":"13_CR19","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. SIGecom Exchanges 13(2), 41\u201346 (2015)","journal-title":"SIGecom Exchanges"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Halpern, D., Procaccia, A.D., Psomas, A., Shah, N.: Fair division with binary valuations: one rule to rule them all. In: Proceedings of the 16th International Conference on Web and Internet Economics (WINE), Springer (2020)","DOI":"10.1007\/978-3-030-64946-3_26"},{"issue":"6","key":"13_CR21","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s10458-018-9393-0","volume":"32","author":"T Heinen","year":"2018","unstructured":"Heinen, T., Nguyen, N.-T., Nguyen, T.T., Rothe, J.: Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods. Auton. Agents Multi-Agent Syst. 32(6), 741\u2013778 (2018). https:\/\/doi.org\/10.1007\/s10458-018-9393-0","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"13_CR22","unstructured":"Kalinowski, T., Narodytska, N., Walsh, T.: A social welfare optimal sequential allocation procedure. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI) (2013)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Kalinowski, T., Narodytska, N., Walsh, T., Xia, L.: Strategic behavior when allocating indivisible goods sequentially. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI) (2013)","DOI":"10.1609\/aaai.v27i1.8697"},{"issue":"2","key":"13_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3140756","volume":"65","author":"D Kurokawa","year":"2018","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. J. ACM 65(2), 1\u201327 (2018)","journal-title":"J. ACM"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair division and collective welfare. MIT press (2004)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"13_CR26","unstructured":"Othman, A., Sandholm, T., Budish, E.: Finding approximate competitive equilibria: efficient and fair course allocation. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (2010)"},{"key":"13_CR27","unstructured":"Vossen, T.: Fair allocation concepts in air traffic management. PhD thesis (2002)"}],"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-43254-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:15:37Z","timestamp":1693782937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43254-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432538","9783031432545"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43254-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 September 2023","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":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","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":"26","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":"44% - 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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}