{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T08:02:14Z","timestamp":1749888134043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"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_23","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"357-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hedonic Diversity Games Revisited"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Darmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., Brandl, F., Brandt, F., Harrenstein, P., Olsen, M., Peters, D.: Fractional hedonic games. ACM Trans. Econ. Comput. 7(2), 6:1\u20136:29 (2019)","DOI":"10.1145\/3327970"},{"key":"23_CR2","unstructured":"Aziz, H., Savani, R.: Hedonic games. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.), Handbook of Computational Social Choice, chapter 15. Cambridge University Press (2016)"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.geb.2003.10.003","volume":"49","author":"C Ballester","year":"2004","unstructured":"Ballester, C.: NP-completeness in hedonic games. Games Econ. Behav. 49, 1\u201330 (2004)","journal-title":"Games Econ. Behav."},{"key":"23_CR4","unstructured":"Baumeister, D., et al.: Axiomatic and computational aspects of scoring allocation rules for indivisible goods. In: Proceedings of the 5th International Workshop on Computational Social Choice (COMSOC 2014), pp. 1\u201322 (2014)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-319-13129-0_44","volume-title":"Web and Internet Economics","author":"V Bil\u00f2","year":"2014","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Monaco, G., Moscardelli, L.: Nash stability in fractional hedonic games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 486\u2013491. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_44"},{"key":"23_CR6","unstructured":"Boehmer, N.: Algorithmic analysis of hedonic games with diversity preferences. Master\u2019s thesis, University of Oxford (2019)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Elkind, E.: Individual-based stability in hedonic diversity games. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pp. 1822\u20131829 (2020)","DOI":"10.1609\/aaai.v34i02.5549"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/game.2001.0877","volume":"38","author":"A Bogomolnaia","year":"2002","unstructured":"Bogomolnaia, A., Jackson, M.: The stability of hedonic coalition structures. Games Econ. Behav. 38, 201\u2013230 (2002)","journal-title":"Games Econ. Behav."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Fishburn, P.C.: Voting procedures. In: Arrow, K.J., Sen, A.K., Suzumura, K. (eds.), Handbook of Social Choice and Welfare, vol. 1, pp. 173\u2013236 (2002)","DOI":"10.1016\/S1574-0110(02)80008-X"},{"key":"23_CR10","unstructured":"Brandl, F., Brandt, F., Strobel, M.: Fractional hedonic games: individual and group stability. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2015), pp. 1219\u20131227 (2015)"},{"key":"23_CR11","unstructured":"Bredereck, R., Elkind, E., Igarashi, A.: Hedonic diversity games. In: Proceedings of the 18th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2019), pp. 565\u2013573 (2019)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Darmann, A.: A social choice approach to ordinal group activity selection. Math. Soc. Sci. 93(C), 57\u201366 (2018)","DOI":"10.1016\/j.mathsocsci.2018.01.005"},{"issue":"2","key":"23_CR13","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."},{"issue":"4","key":"23_CR14","doi-asserted-by":"publisher","first-page":"987","DOI":"10.2307\/1912943","volume":"48","author":"J Dr\u00e8ze","year":"1980","unstructured":"Dr\u00e8ze, J., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48(4), 987\u20131003 (1980)","journal-title":"Econometrica"},{"key":"23_CR15","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. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7"},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00355-006-0214-z","volume":"29","author":"C Klamler","year":"2007","unstructured":"Klamler, C., Pferschy, U.: The traveling group problem. Soc. Choice Welfare 29(3), 429\u2013452 (2007)","journal-title":"Soc. Choice Welfare"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Peters, D.: Complexity of hedonic games with dichotomous preferences. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI 2016), pp. 579\u2013585 (2016)","DOI":"10.1609\/aaai.v30i1.10047"}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:54Z","timestamp":1673647314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}