{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T02:28:40Z","timestamp":1771381720371,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031206139","type":"print"},{"value":"9783031206146","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20614-6_11","type":"book-chapter","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T16:02:37Z","timestamp":1670688157000},"page":"188-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Maximin Shares Under Cardinality Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5691-8177","authenticated-orcid":false,"given":"Halvard","family":"Hummel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4204-2017","authenticated-orcid":false,"given":"Magnus Lie","family":"Hetland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,11]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aigner-Horev, E., Segal-Halevi, E.: Envy-free matchings in bipartite graphs and their applications to fair division. Information Sci. 587, 164\u2013187 (2022). https:\/\/doi.org\/10.1016\/j.ins.2021.11.059. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025521011816","DOI":"10.1016\/j.ins.2021.11.059"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation algorithms for computing maximin share allocations. ACM Trans. Algor. 13(4), 1\u201328 (2017). https:\/\/doi.org\/10.1145\/3147173. https:\/\/doi.org\/10.1145\/3147173","DOI":"10.1145\/3147173"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Nisan, N., Talgam-Cohen, I.: Competitive equilibrium with indivisible goods and generic budgets. Math. Oper. Res. 46(1), 382\u2013403 (2021). https:\/\/doi.org\/10.1287\/moor.2020.1062. https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/moor.2020.1062. publisher: INFORMS","DOI":"10.1287\/moor.2020.1062"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Barman, S., Krishna Murthy, S.K.: Approximation algorithms for maximin fair division. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 647\u2013664. EC 2017, Association for Computing Machinery, Cambridge, Massachusetts, USA (2017). https:\/\/doi.org\/10.1145\/3033274.3085136. https:\/\/doi.org\/10.1145\/3033274.3085136","DOI":"10.1145\/3033274.3085136"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, V., et al.: Almost envy-free allocations with connected bundles. In: Blum, A. (ed.) 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), vol. 124, pp. 1\u201321. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.14. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2018\/10107. iSSN: 1868-8969","DOI":"10.4230\/LIPIcs.ITCS.2019.14"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Biswas, A., Barman, S.: Fair division under cardinality constraints. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, pp. 91\u201397. International Joint Conferences on Artificial Intelligence Organization, Stockholm, Sweden (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/13. https:\/\/www.ijcai.org\/proceedings\/2018\/13","DOI":"10.24963\/ijcai.2018\/13"},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Bouveret, S., Cechl\u00e1rov\u00e1, K., Elkind, E., Igarashi, A., Peters, D.: Fair division of a graph. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, pp. 135\u2013141. International Joint Conferences on Artificial Intelligence Organization, Melbourne, Australia (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/20. https:\/\/www.ijcai.org\/proceedings\/2017\/20","DOI":"10.24963\/ijcai.2017\/20"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Chevaleyre, Y., Maudet, N.: Fair Allocation of Indivisible Goods. In: Handbook of Computational Social Choice, pp. 285\u2013310. Cambridge University Press, 32 Avenue of the Americas, New York, NY 10013\u20132473, USA, 1 edn. (2016). https:\/\/www.cambridge.org\/no\/academic\/subjects\/computer-science\/artificial-intelligence-and-natural-language-processing\/handbook-computational-social-choice?format=HB &isbn=9781107060432","DOI":"10.1017\/CBO9781107446984.013"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Bouveret, S., Lema\u00eetre, M.c.: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton. Agents Multi-Agent Syst. 30(2), 259\u2013290 (2016). https:\/\/doi.org\/10.1007\/s10458-015-9287-3. https:\/\/link.springer.com\/10.1007\/s10458-015-9287-3","DOI":"10.1007\/s10458-015-9287-3"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011). https:\/\/doi.org\/10.1086\/664613. https:\/\/www.journals","DOI":"10.1086\/664613"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Chiarelli, N., Krnc, M., Milani\u010d, M., Pferschy, U., Piva\u010d, N., Schauer, J.: Fair packing of independent sets. In: Klasing, R., Radzik, T. (eds.) IWOCA 2020. LNCS, vol. 12126, pp. 154\u2013165. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48966-3_12","DOI":"10.1007\/978-3-030-48966-3_12"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Feige, U., Sapir, A., Tauber, L.: A tight negative example for MMS fair allocations. arXiv:2104.04977 (2021)","DOI":"10.1007\/978-3-030-94676-0_20"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Ferraioli, D., Gourv\u00e8s, L., Monnot, J.: On regular and approximately fair allocations of indivisible goods. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. pp. 997\u20131004. AAMAS 2014, International Foundation for Autonomous Agents and Multiagent Systems, Paris, France (2014). https:\/\/doi.org\/10.5555\/2615731.2617405","DOI":"10.5555\/2615731.2617405"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Garg, J., McGlaughlin, P., Taki, S.: Approximating maximin share allocations. In: Fineman, J.T., Mitzenmacher, M. (eds.) 2nd Symposium on Simplicity in Algorithms (SOSA 2019). OpenAccess Series in Informatics (OASIcs), vol. 69, pp. 1\u201311. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2019.20. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2018\/10046","DOI":"10.4230\/OASIcs.SOSA.2019.20"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Garg, J., Taki, S.: An improved approximation algorithm for maximin shares. In: Proceedings of the 21st ACM Conference on Economics and Computation. pp. 379\u2013380. EC 2020, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3391403.3399526. https:\/\/doi.org\/10.1145\/3391403.3399526. arXiv: 1903.00029","DOI":"10.1145\/3391403.3399526"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Ghodsi, M., Hajiaghayi, M., Seddighin, M., Seddighin, S., Yami, H.: Fair allocation of indivisible goods: improvements and generalizations. In: Proceedings of the 2018 ACM Conference on Economics and Computation. pp. 539\u2013556. EC 2018, Association for Computing Machinery, Ithaca, NY, USA (2018). https:\/\/doi.org\/10.1145\/3219166.3219238. https:\/\/doi.org\/10.1145\/3219166.3219238","DOI":"10.1145\/3219166.3219238"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Gourv\u00e8s, L., Monnot, J.: On maximin share allocations in matroids. Theor. Comput. Sci. 754, 50\u201364 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.05.018. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397518303384","DOI":"10.1016\/j.tcs.2018.05.018"},{"key":"11_CR18","unstructured":"Gourv\u00e8s, L., Monnot, J., Tlilane, L.: Near fairness in matroids. In: Proceedings of the Twenty-first European Conference on Artificial Intelligence. pp. 393\u2013398. ECAI2014, IOS Press, Prague, Czech Republic (2014)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Greco, G., Scarcello, F.: The complexity of computing maximin share allocations on graphs. Proceed. AAAI Conf. Artif. Intell. 34(02), 2006\u20132013 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i02.5572,.https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/5572","DOI":"10.1609\/aaai.v34i02.5572"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Hummel, H., Hetland, M.L.: Fair allocation of conflicting items. Auton. Agents Multi-Agent Syst. 36(1), 8 (2021). https:\/\/doi.org\/10.1007\/s10458-021-09537-3. https:\/\/doi.org\/10.1007\/s10458-021-09537-3","DOI":"10.1007\/s10458-021-09537-3"},{"key":"11_CR21","unstructured":"Hummel, H., Hetland, M.L.: Guaranteeing half-maximin shares under cardinality constraints. In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, pp. 1633\u20131635. AAMAS 2022, International Foundation for Autonomous Agents and Multiagent Systems (2022)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: When can the maximin share guarantee be guaranteed? In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 523\u2013529. AAAI2016, AAAI Press, Phoenix, Arizona (2016)","DOI":"10.1609\/aaai.v30i1.10041"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. J. ACM 65(2), 1\u201327 (2018). https:\/\/doi.org\/10.1145\/3140756. https:\/\/doi.org\/10.1145\/3140756","DOI":"10.1145\/3140756"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Li, Z., Vetta, A.: The fair division of hereditary set systems. ACM Trans. Econ. Comput. 9(2), 1\u201319 (2021). https:\/\/doi.org\/10.1145\/3434410. https:\/\/dl.acm.org\/doi\/10.1145\/3434410","DOI":"10.1145\/3434410"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Lonc, Z., Truszczynski, M.: Maximin share allocations on cycles. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI-18, pp. 410\u2013416. International Joint Conferences on Artificial Intelligence Organization (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/57. https:\/\/doi.org\/10.24963\/ijcai.2018\/57","DOI":"10.24963\/ijcai.2018\/57"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. In: Proceedings of the fifteenth ACM conference on Economics and computation, pp. 675\u2013692. EC 2014, Association for Computing Machinery, Palo Alto, California, USA (2014). https:\/\/doi.org\/10.1145\/2600057.2602835. https:\/\/doi.org\/10.1145\/2600057.2602835","DOI":"10.1145\/2600057.2602835"},{"key":"11_CR27","unstructured":"Shoshan, H., Segal-Halevi, E., Hazon, N.: Efficient nearly-fair division with capacity constraints. arXiv:2205.07779 (2022). https:\/\/arxiv.org\/abs\/2205.07779. arXiv: 2205.07779"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Suksompong, W.: Constraints in fair division. ACM SIGecom Exchanges 19(2), 46\u201361 (2021). https:\/\/doi.org\/10.1145\/3505156.3505162","DOI":"10.1145\/3505156.3505162"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J.: A polynomial-time approximation scheme for maximizing the minimum machine completion time. Operat. Res. Lett. 20(4), 149\u2013154 (1997). https:\/\/doi.org\/10.1016\/S0167-6377(96)00055-7. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167637796000557","DOI":"10.1016\/S0167-6377(96)00055-7"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20614-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T16:04:07Z","timestamp":1670688247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20614-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206139","9783031206146"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20614-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"D\u00fcsseldorf","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","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":"eumas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ccc.cs.hhu.de\/eumas2022\/","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":"36","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":"23","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":"64% - 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":"3","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)"}}]}}