{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T03:22:53Z","timestamp":1768706573031,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T00:00:00Z","timestamp":1582502400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T00:00:00Z","timestamp":1582502400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["PDF\/2016\/003508"],"award-info":[{"award-number":["PDF\/2016\/003508"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["1176\/18"],"award-info":[{"award-number":["1176\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10458-020-09452-z","type":"journal-article","created":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T08:06:01Z","timestamp":1582531561000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Gehrlein stability in committee selection: parameterized hardness and algorithms"],"prefix":"10.1007","volume":"34","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":"Sanjukta","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meirav","family":"Zehavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,24]]},"reference":[{"key":"9452_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., Elkind, E., Faliszewski, P., Lackner, M., & Skowron, P. (2017). The Condorcet principle for multiwinner elections: From shortlisting to proportionality. In: IJCAI, pp. 84\u201390.","DOI":"10.24963\/ijcai.2017\/13"},{"issue":"2","key":"9452_CR2","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., & Even, S. (1981). A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2(2), 198\u2013203.","journal-title":"Journal of Algorithms"},{"issue":"40\u201342","key":"9452_CR3","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I. A., & Xia, G. (2010). Improved upper bounds for vertex cover. Theoretical Computer Science, 411(40\u201342), 3736\u20133756.","journal-title":"Theoretical Computer Science"},{"key":"9452_CR4","volume-title":"Understanding, evaluating and selecting voting rules through games and axioms","author":"D Coelho","year":"2005","unstructured":"Coelho, D. (2005). Understanding, evaluating and selecting voting rules through games and axioms. Bellaterra: Universitat Aut\u00f2noma de Barcelona."},{"key":"9452_CR5","unstructured":"Condorcet, M. D. (1785). Essai sur l\u2019application de l\u2019analyse, a la probabilite des decisions rendues a la pluralite des voix. A Paris, De L'imprimerie Royal, M. DCC LXX V."},{"key":"9452_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., et al. (2015). Parameterized algorithms. Berlin: Springer."},{"issue":"3","key":"9452_CR7","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. (2013). How hard is it to tell which is a Condorcet committee? Mathematical Social Sciences, 66(3), 282\u2013292.","journal-title":"Mathematical Social Sciences"},{"issue":"1\u20132","key":"9452_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R. G., & Fellows, M. R. (1995). Fixed-parameter tractability and completeness II: On completeness for w-[1]. Theoretical Computer Science, 141(1\u20132), 109\u2013131.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9452_CR9","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. (2017). Properties of multiwinner voting rules. Social Choice and Welfare, 48(3), 599\u2013632.","journal-title":"Social Choice and Welfare"},{"issue":"3","key":"9452_CR10","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00355-014-0853-4","volume":"44","author":"E Elkind","year":"2015","unstructured":"Elkind, E., Lang, J., & Saffidine, A. (2015). Condorcet winning sets. Social Choice and Welfare, 44(3), 493\u2013517.","journal-title":"Social Choice and Welfare"},{"key":"9452_CR11","first-page":"27","volume":"74","author":"P Faliszewski","year":"2017","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., & Talmon, N. (2017). Multiwinner voting: A new challenge for social choice theory. Trends in Computational Social Choice, 74, 27\u201347.","journal-title":"Trends in Computational Social Choice"},{"issue":"3","key":"9452_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0141041","volume":"41","author":"PC Fishburn","year":"1981","unstructured":"Fishburn, P. C. (1981). An analysis of simple voting systems for electing committees. SIAM Journal on Applied Mathematics, 41(3), 499\u2013502.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"9452_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/9781107415157","volume-title":"Kernelization: Theory of parameterized preprocessing","author":"FV Fomin","year":"2018","unstructured":"Fomin, F. V., Lokshtanov, D., Saurabh, S., & Zehavi, M. (2018). Kernelization: Theory of parameterized preprocessing. Cambridge: Cambridge University Press."},{"issue":"3","key":"9452_CR14","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. (1985). The Condorcet criterion and committee selection. Mathematical Social Sciences, 10(3), 199\u2013209.","journal-title":"Mathematical Social Sciences"},{"issue":"4","key":"9452_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0196-6774(83)90011-1","volume":"4","author":"P Hell","year":"1983","unstructured":"Hell, P., & Rosenfeld, M. (1983). The complexity of finding generalized paths in tournaments. Journal of Algorithms, 4(4), 303\u2013309.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"9452_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(93)90246-K","volume":"41","author":"JB Jensen","year":"1993","unstructured":"Jensen, J. B., & Hell, P. (1993). Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs. Discrete Applied Mathematics, 41(1), 75\u201379.","journal-title":"Discrete Applied Mathematics"},{"key":"9452_CR17","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. (2017). On stable rules for selecting committees. Journal of Mathematical Economics, 70, 36\u201344.","journal-title":"Journal of Mathematical Economics"},{"issue":"3","key":"9452_CR18","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s003550200194","volume":"20","author":"B Kaymak","year":"2003","unstructured":"Kaymak, B., & Sanver, M. R. (2003). Sets of alternatives as Condorcet winners. Social Choice and Welfare, 20(3), 477\u2013494.","journal-title":"Social Choice and Welfare"},{"key":"9452_CR19","volume-title":"Tournament solutions and majority voting. Studies in economic theory","author":"J Laslier","year":"2011","unstructured":"Laslier, J. (2011). Tournament solutions and majority voting. Studies in economic theory. Berlin: Springer."},{"issue":"4","key":"9452_CR20","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"DC McGarvey","year":"1953","unstructured":"McGarvey, D. C. (1953). A theorem on the construction of voting paradoxes. Econometrica, 21(4), 608\u2013610.","journal-title":"Econometrica"},{"issue":"1","key":"9452_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00355-007-0268-6","volume":"31","author":"S Salvador","year":"2008","unstructured":"Salvador, S., & Coelho, D. (2008). How to choose a non-controversial list with k names. Social Choice and Welfare, 31(1), 79\u201396.","journal-title":"Social Choice and Welfare"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-020-09452-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-020-09452-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-020-09452-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:47:13Z","timestamp":1614041233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-020-09452-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,24]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["9452"],"URL":"https:\/\/doi.org\/10.1007\/s10458-020-09452-z","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,24]]},"assertion":[{"value":"24 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"27"}}