{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T22:14:18Z","timestamp":1778883258684,"version":"3.51.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030877552","type":"print"},{"value":"9783030877569","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_16","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"243-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs"],"prefix":"10.1007","author":[{"given":"Nina","family":"Chiarelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cl\u00e9ment","family":"Dallard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Darmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Lendl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Mur\u0161i\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nevena","family":"Piva\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.artint.2015.06.002","volume":"227","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Walsh, T.: Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. 227, 71\u201392 (2015)","journal-title":"Artif. Intell."},{"key":"16_CR2","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\u201920), pp. 5119\u20135126. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"16_CR3","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 (STOC\u201906), pp. 31\u201340 (2006)","DOI":"10.1145\/1132516.1132522"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/s10458-016-9340-x","volume":"31","author":"D Baumeister","year":"2016","unstructured":"Baumeister, D., et al.: Positional scoring-based allocation of indivisible goods. Auton. Agents Multi-Agent Syst. 31(3), 628\u2013655 (2016). https:\/\/doi.org\/10.1007\/s10458-016-9340-x","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Chevaleyre, Y., Maudet, N.: Fair division of indivisible goods. In: Brandt, F., et al. (eds.) Handbook of Computational Social Choice, chapter 12. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.013"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1090\/noti1075","volume":"61","author":"S Brams","year":"2014","unstructured":"Brams, S., Kilgour, M., Klamler, C.: Two-person fair division of indivisible items: an efficient, envy-free algorithm. Notices AMS 61(2), 130\u2013141 (2014)","journal-title":"Notices AMS"},{"key":"16_CR7","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: Gasieniec, L., 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":"16_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2015.05.071","volume":"247","author":"A Darmann","year":"2015","unstructured":"Darmann, A., Schauer, J.: Maximizing Nash product social welfare in allocating indivisible goods. Eur. J. Oper. Res. 247(2), 548\u2013559 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.mathsocsci.2014.10.005","volume":"73","author":"C Duddy","year":"2015","unstructured":"Duddy, C.: Fair sharing under dichotomous preferences. Math. Soc. Sci. 73, 1\u20135 (2015)","journal-title":"Math. Soc. Sci."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Garg, J., McGlaughlin, P.: Improving Nash social welfare approximations. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI\u201919), pp. 294\u2013300 (2019)","DOI":"10.24963\/ijcai.2019\/42"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-3094-4","volume-title":"Multiple Criteria Decision Analysis","author":"S Greco","year":"2016","unstructured":"Greco, S., Ehrgott, M., Figueira, J.R.: Multiple Criteria Decision Analysis, 2nd edn. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-1-4939-3094-4","edition":"2"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-030-64946-3_26","volume-title":"Web and Internet Economics","author":"D Halpern","year":"2020","unstructured":"Halpern, D., Procaccia, A.D., Psomas, A., Shah, N.: Fair division with binary valuations: one rule to rule them all. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 370\u2013383. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_26"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s003550100119","volume":"19","author":"D Herreiner","year":"2002","unstructured":"Herreiner, D., Puppe, C.: A simple procedure for finding equitable allocations of indivisible goods. Soc. Choice Welfare 19(2), 415\u2013430 (2002). https:\/\/doi.org\/10.1007\/s003550100119","journal-title":"Soc. Choice Welfare"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"16_CR17","unstructured":"Roos, M., Rothe, J.: Complexity of social welfare optimization in multiagent resource allocation. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201910), pp. 641\u2013648 (2010)"},{"key":"16_CR18","unstructured":"Schrijver, A.: Combinatorial optimization. In: Polyhedra and Efficiency, vol. 24. Springer-Verlag, Berlin (2003)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Thomson, W.: Introduction to the theory of fair allocation. In: Brandt, F., et al. (eds.) Handbook of Computational Social Choice, chapter 11. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.012"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:47Z","timestamp":1673647307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","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":"58","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":"27","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":"47% - 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":"7","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)"}}]}}