{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:18:25Z","timestamp":1742915905835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157134"},{"type":"electronic","value":"9783031157141"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15714-1_29","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:26:44Z","timestamp":1663090004000},"page":"508-525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gehrlein Stable Committee with\u00a0Multi-modal Preferences"],"prefix":"10.1007","author":[{"given":"Sushmita","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pallavi","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjukta","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"issue":"6","key":"29_CR1","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s10726-019-09634-5","volume":"28","author":"H Aziz","year":"2019","unstructured":"Aziz, H.: A rule for committee selection with soft diversity constraints. Group Decis. Negot. 28(6), 1193\u20131200 (2019)","journal-title":"Group Decis. Negot."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., Elkind, E., Faliszewski, P., Lackner, M., Skowron, P.: The condorcet principle for multiwinner elections: from shortlisting to proportionality. In: IJCAI, pp. 84\u201390 (2017)","DOI":"10.24963\/ijcai.2017\/13"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Elkind, E., Faliszewski, P., Lackner, M., Skowron, P.: The condorcet principle for multiwinner elections: from shortlisting to proportionality. arXiv preprint arXiv:1701.08023 (2017)","DOI":"10.24963\/ijcai.2017\/13"},{"key":"29_CR4","unstructured":"Boehmer, N., Niedermeier, R.: Broadening the research agenda for computational social choice: multiple preference profiles and multiple solutions. In: AAMAS 2021, pp. 1\u20135 (2021)"},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/TST.2014.6867518","volume":"19","author":"R Bredereck","year":"2014","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Guo, J., Niedermeier, R., Woeginger, G.: Parameterized algorithmics for computational social choice. Tsinghua Sci. Technol. 19(4), 358 (2014)","journal-title":"Tsinghua Sci. Technol."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Igarashi, A., Lackner, M., Skowron, P.: Multiwinner elections with diversity constraints. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11457"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1093\/comjnl\/bxm086","volume":"51","author":"L Cai","year":"2008","unstructured":"Cai, L.: Parameterized complexity of cardinality constrained optimization problems. Comput. J. 51(1), 102\u2013121 (2008)","journal-title":"Comput. J."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Celis, L.E., Huang, L., Vishnoi, N.K.: Multiwinner voting with fairness constraints, pp. 144\u2013151 (2018)","DOI":"10.24963\/ijcai.2018\/20"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., Niedermeier, R., Skowron, P.: Stable marriage with multi-modal preferences. In: EC, pp. 269\u2013286 (2018)","DOI":"10.1145\/3219166.3219168"},{"key":"29_CR10","unstructured":"Coelho, D.: Understanding, evaluating and selecting voting rules through games and axioms. Ph.D. thesis, Universitat Aut\u00f2noma de Barcelona (2005)"},{"key":"29_CR11","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.mathsocsci.2013.06.004","volume":"66","author":"A Darmann","year":"2013","unstructured":"Darmann, A.: How hard is it to tell which is a condorcet committee? Math. Soc. Sci. 66(3), 282\u2013292 (2013)","journal-title":"Math. Soc. Sci."},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 4th edn, vol. 173. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Do, V., Atif, J., Lang, J., Usunier, N.: Online selection of diverse committees. In: IJCAI, pp. 154\u2013160 (2021)","DOI":"10.24963\/ijcai.2021\/22"},{"key":"29_CR15","unstructured":"Dorn, B., Schlotter, I.: Having a hard time? Explore parameterized complexity. In: Endriss, U. (ed.) Trends in Computational Social Choice. AI Access (2017)"},{"key":"29_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"3","key":"29_CR17","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00355-017-1026-z","volume":"48","author":"E Elkind","year":"2017","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., Slinko, A.: Properties of multiwinner voting rules. Soc. Choice Welfare 48(3), 599\u2013632 (2017). https:\/\/doi.org\/10.1007\/s00355-017-1026-z","journal-title":"Soc. Choice Welfare"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Niedermeier, R.: Parameterization in computational social choice. In: Encyclopedia of Algorithms, pp. 1516\u20131520 (2016)","DOI":"10.1007\/978-1-4939-2864-4_785"},{"key":"29_CR19","first-page":"27","volume":"74","author":"P Faliszewski","year":"2017","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner voting: a new challenge for social choice theory. Trends Comput. Soc. Choice 74, 27\u201347 (2017)","journal-title":"Trends Comput. Soc. Choice"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Committee scoring rules: axiomatic characterization and hierarchy. TEAC 7(1), 3:1\u20133:39 (2019)","DOI":"10.1145\/3296672"},{"issue":"3","key":"29_CR21","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0141041","volume":"41","author":"PC Fishburn","year":"1981","unstructured":"Fishburn, P.C.: An analysis of simple voting systems for electing committees. SIAM J. Appl. Math. 41(3), 499\u2013502 (1981)","journal-title":"SIAM J. Appl. Math."},{"key":"29_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"29_CR23","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"3","key":"29_CR24","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0165-4896(85)90043-5","volume":"10","author":"WV Gehrlein","year":"1985","unstructured":"Gehrlein, W.V.: The condorcet criterion and committee selection. Math. Soc. Sci. 10(3), 199\u2013209 (1985)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"29_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-020-09452-z","volume":"34","author":"S Gupta","year":"2020","unstructured":"Gupta, S., Jain, P., Roy, S., Saurabh, S., Zehavi, M.: Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agent. Multi-Agent Syst. 34(1), 1\u201321 (2020). https:\/\/doi.org\/10.1007\/s10458-020-09452-z","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"29_CR26","unstructured":"Jain, P., Talmon, N.: Committee selection with multimodal preferences. In: ECAI, pp. 123\u2013130 (2020)"},{"key":"29_CR27","unstructured":"Kagita, V.R., Pujari, A.K., Padmanabhan, V., Aziz, H., Kumar, V.: Committee selection using attribute approvals. In: AAMAS, pp. 683\u2013691 (2021)"},{"key":"29_CR28","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jmateco.2017.01.008","volume":"70","author":"E Kamwa","year":"2017","unstructured":"Kamwa, E.: On stable rules for selecting committees. J. Math. Econ. 70, 36\u201344 (2017)","journal-title":"J. Math. Econ."},{"key":"29_CR29","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.artint.2018.07.005","volume":"263","author":"J Lang","year":"2018","unstructured":"Lang, J., Skowron, P.: Multi-attribute proportional representation. Artif. Intell. 263, 74\u2013106 (2018)","journal-title":"Artif. Intell."},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"McGarvey, D.C.: A theorem on the construction of voting paradoxes. Econometrica J. Econometric Soc. 608\u2013610 (1953)","DOI":"10.2307\/1907926"},{"issue":"2","key":"29_CR31","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(88)90131-4","volume":"61","author":"N Megiddo","year":"1988","unstructured":"Megiddo, N., Vishkin, U.: On finding a minimum dominating set in a tournament. Theoret. Comput. Sci. 61(2), 307\u2013316 (1988)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"29_CR32","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s00355-003-0209-y","volume":"21","author":"TC Ratliff","year":"2003","unstructured":"Ratliff, T.C.: Some startling inconsistencies when electing committees. Soc. Choice Welf. 21(3), 433\u2013454 (2003)","journal-title":"Soc. Choice Welf."},{"key":"29_CR33","doi-asserted-by":"crossref","unstructured":"Relia, K.: Dire committee: diversity and representation constraints in multiwinner elections. arXiv preprint arXiv:2107.07356 (2021)","DOI":"10.24963\/ijcai.2022\/714"},{"key":"29_CR34","doi-asserted-by":"crossref","unstructured":"Barber\u00e1, S., Coelho, D.: How to choose a non-controversial list with k names. Soc. Choice Welf. 31(1), 79\u201396 (2008)","DOI":"10.1007\/s00355-007-0268-6"},{"key":"29_CR35","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-030-82254-5_10","volume-title":"Multi-Agent Systems","author":"B Steindl","year":"2021","unstructured":"Steindl, B., Zehavi, M.: Parameterized analysis of assignment under multiple preferences. In: Rosenfeld, A., Talmon, N. (eds.) EUMAS 2021. LNCS (LNAI), vol. 12802, pp. 160\u2013177. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-82254-5_10"},{"key":"29_CR36","unstructured":"Wen, Y., Zhou, A., Guo, J.: Position-based matching with multi-modal preferences. In: AAMAS 2022, pp. 1373\u20131381 (2022)"}],"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-15714-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:29:59Z","timestamp":1663090199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15714-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157134","9783031157141"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15714-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","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":"Colchester","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2022","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","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":"34","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":"41% - 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.01","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":"6.9","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)"}}]}}