{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T21:28:12Z","timestamp":1785101292251,"version":"3.55.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T00:00:00Z","timestamp":1524096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["DEC-2012\/06\/M\/ST1\/00358"],"award-info":[{"award-number":["DEC-2012\/06\/M\/ST1\/00358"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007751","name":"Akademia G\u00f3rniczo-Hutnicza im. Stanislawa Staszica","doi-asserted-by":"publisher","award":["11.11.230.124 (statutory research)"],"award-info":[{"award-number":["11.11.230.124 (statutory research)"]}],"id":[{"id":"10.13039\/501100007751","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001509","name":"Royal Society of New Zealand","doi-asserted-by":"publisher","award":["Marsden Fund UOA-254"],"award-info":[{"award-number":["Marsden Fund UOA-254"]}],"id":[{"id":"10.13039\/501100001509","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Research Training Group MDS (GRK 1408)"],"award-info":[{"award-number":["Research Training Group MDS (GRK 1408)"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt-Stiftung","doi-asserted-by":"publisher","award":["Humboldt Research Fellowship for Postdoctoral Researchers"],"award-info":[{"award-number":["Humboldt Research Fellowship for Postdoctoral Researchers"]}],"id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-StG639945"],"award-info":[{"award-number":["ERC-StG639945"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc Choice Welf"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00355-018-1126-4","type":"journal-article","created":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T13:23:56Z","timestamp":1524144236000},"page":"513-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0332-4364","authenticated-orcid":false,"given":"Piotr","family":"Faliszewski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8802-6015","authenticated-orcid":false,"given":"Piotr","family":"Skowron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0397-6290","authenticated-orcid":false,"given":"Arkadii","family":"Slinko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7916-0979","authenticated-orcid":false,"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,4,19]]},"reference":[{"key":"1126_CR1","unstructured":"Alon N, Arora S, Manokaran R, Moshkovitz D, Weinstein O (2011) Inapproximabilty of densest k-subgraph from average case hardness. http:\/\/www.nada.kth.se\/~rajsekar\/papers\/dks.pdf . Accessed 15 Apr 2018"},{"issue":"2","key":"1126_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00355-016-1019-3","volume":"48","author":"H Aziz","year":"2017","unstructured":"Aziz H, Brill M, Conitzer V, Elkind E, Freeman R, Walsh T (2017) Justified representation in approval-based committee voting. Soc Choice Welfare 48(2):461\u2013485","journal-title":"Soc Choice Welfare"},{"key":"1126_CR3","unstructured":"Aziz H, Gaspers S, Gudmundsson J, Mackenzie S, Mattei N, Walsh T (2015) Computational aspects of multi-winner approval voting. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp 107\u2013115"},{"key":"1126_CR4","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1007\/978-1-4020-7964-1_4","volume-title":"Handbook of utility theory","author":"S Barber\u00e0","year":"2004","unstructured":"Barber\u00e0 S, Bossert W, Pattanaik P (2004) Ranking sets of objects. In: Barber\u00e0 S, Hammond P, Seidl C (eds) Handbook of utility theory. Springer, New York, pp 893\u2013977"},{"issue":"1","key":"1126_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00355-007-0268-6","volume":"31","author":"S Barber\u00e0","year":"2008","unstructured":"Barber\u00e0 S, Coelho D (2008) How to choose a non-controversial list with $$k$$ k names. Soc Choice Welfare 31(1):79\u201396","journal-title":"Soc Choice Welfare"},{"key":"1126_CR6","doi-asserted-by":"crossref","unstructured":"Baumeister D, B\u00f6hnlein T, Rey L, Schaudt O, Selker AK (2016) Minisum and minimax committee election rules for general preference types. In: Proceedings of the 22nd European Conference on Artificial Intelligence, pp 1656\u20131657","DOI":"10.3233\/978-1-61499-672-9-1656"},{"key":"1126_CR7","unstructured":"Baumeister D, Dennisen S (2015) Voter dissatisfaction in committee elections. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp 1707\u20131708"},{"key":"1126_CR8","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-319-23114-3_28","volume-title":"Algorithmic Decision Theory","author":"Dorothea Baumeister","year":"2015","unstructured":"Baumeister D, Dennisen S, Rey L (2015) Winner determination and manipulation in minisum and minimax committee elections. In: Proceedings of the 4th International Conference on Algorithmic Decision Theory, pp 469\u2013485"},{"key":"1126_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-02839-7_10","volume-title":"Handbook of approval voting","author":"D Baumeister","year":"2010","unstructured":"Baumeister D, Erd\u00e9lyi G, Hemaspaandra E, Hemaspaandra L, Rothe J (2010) Computational aspects of approval voting. In: Laslier J, Sanver R (eds) Handbook of approval voting. Springer, New York, pp 199\u2013251"},{"key":"1126_CR10","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1613\/jair.3896","volume":"47","author":"N Betzler","year":"2013","unstructured":"Betzler N, Slinko A, Uhlmann J (2013) On the computation of fully proportional representation. J Artif Intell Res 47:475\u2013519","journal-title":"J Artif Intell Res"},{"key":"1126_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C Boutilier","year":"2004","unstructured":"Boutilier C, Brafman R, Domshlak C, Hoos H, Poole D (2004) CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J Artif Intell Res 21:135\u2013191","journal-title":"J Artif Intell Res"},{"key":"1126_CR12","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-23114-3_25","volume-title":"Algorithmic Decision Theory","author":"Robert Bredereck","year":"2015","unstructured":"Bredereck R, Faliszewski P, Niedermeier R, Skowron P, Talmon N (2015) Elections with few candidates: Prices, weights, and covering problems. In: Proceedings of the 4th International Conference on Algorithmic Decision Theory, pp 414\u2013431"},{"key":"1126_CR13","doi-asserted-by":"crossref","unstructured":"Brill M, Laslier J, Skowron P (2017) Multiwinner approval rules as apportionment methods. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence, pp 414\u2013420","DOI":"10.1609\/aaai.v31i1.10600"},{"key":"1126_CR14","unstructured":"Byrka J, Skowron P, Sornat K (2017) Proportional approval voting, harmonic k-median, and negative association. Technical Report arXiv:1704.02183 [cs.DS]"},{"key":"1126_CR15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-319-13129-0_15","volume-title":"Web and Internet Economics","author":"Jaros\u0142aw Byrka","year":"2014","unstructured":"Byrka J, Sornat K (2014) PTAS for minimax approval voting. In: Proceedings of the 10th Conference on Web and Internet Economics, pp 203\u2013217"},{"issue":"3","key":"1126_CR16","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"B Chamberlin","year":"1983","unstructured":"Chamberlin B, Courant P (1983) Representative deliberations and representative decisions: proportional representation and the Borda rule. Am Polit Sci Rev 77(3):718\u2013733","journal-title":"Am Polit Sci Rev"},{"key":"1126_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized algorithm","author":"M Cygan","year":"2015","unstructured":"Cygan M, Fomin F, Kowalik \u0141, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithm. Springer, New York"},{"key":"1126_CR18","doi-asserted-by":"crossref","unstructured":"Cygan M, Kowalik L, Socala A, Sornat K (2017) Approximation and parameterized complexity of minimax approval voting. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence, pp 459\u2013465","DOI":"10.1609\/aaai.v31i1.10575"},{"issue":"4","key":"1126_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF00182574","volume":"9","author":"B Debord","year":"1992","unstructured":"Debord B (1992) An axiomatic characterization of Borda\u2019s $$k$$ k -choice function. Soc Choice Welfare 9(4):337\u2013343","journal-title":"Soc Choice Welfare"},{"key":"1126_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0165-4896(93)90012-8","volume":"26","author":"B Debord","year":"1993","unstructured":"Debord B (1993) Prudent $$k$$ k -choice functions: Properties and algorithms. Math Soc Sci 26:63\u201377","journal-title":"Math Soc Sci"},{"key":"1126_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R Downey","year":"1999","unstructured":"Downey R, Fellows M (1999) Parameterized complexity. Springer-Verlag, New York"},{"key":"1126_CR22","volume-title":"Voting procedures","author":"M Dummett","year":"1984","unstructured":"Dummett M (1984) Voting procedures. Oxford University Press, Oxford"},{"key":"1126_CR23","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. Soc Choice Welfare 48:599\u2013632","journal-title":"Soc Choice Welfare"},{"key":"1126_CR24","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-319-23114-3_29","volume-title":"Algorithmic Decision Theory","author":"Edith Elkind","year":"2015","unstructured":"Elkind E, Ismaili A (2015) OWA-based extensions of the Chamberlin-Courant rule. In: Proceedings of the 4th International Conference on Algorithmic Decision Theory, pp 486\u2013502"},{"key":"1126_CR25","unstructured":"Elkind E, Lackner M (2015) Structure in dichotomous preferences. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence, pp 2019\u20132025"},{"issue":"1","key":"1126_CR26","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MIS.2017.5","volume":"32","author":"P Faliszewski","year":"2017","unstructured":"Faliszewski P, Sawicki J, Schaefer R, Smolka M (2017) Multiwinner voting in genetic algorithms. IEEE Intell Syst 32(1):40\u201348","journal-title":"IEEE Intell Syst"},{"key":"1126_CR27","unstructured":"Faliszewski P, Skowron P, Slinko A, Talmon N (2016) Committee scoring rules: Axiomatic classification and hierarchy. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, pp 250\u2013256. For the full version, see the arXiv report arXiv:1802.06483 [cs.GT]"},{"key":"1126_CR28","doi-asserted-by":"crossref","unstructured":"Faliszewski P, Skowron P, Slinko A, Talmon N (2016) Multiwinner analogues of the plurality rule: Axiomatic and algorithmic perspectives. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence, pp 482\u2013488","DOI":"10.1609\/aaai.v30i1.10031"},{"key":"1126_CR29","doi-asserted-by":"crossref","unstructured":"Faliszewski P, Skowron P, Slinko A, Talmon N (2017) Multiwinner rules on paths from $$k$$ k -Borda to Chamberlin\u2013Courant. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp 192\u2013198","DOI":"10.24963\/ijcai.2017\/28"},{"key":"1126_CR30","unstructured":"Faliszewski P, Skowron P, Slinko A, Talmon N (2017) Multiwinner voting: a new challenge for social choice theory. In: Endriss U (ed.), Trends in Computational Social Choice, ch.\u00a02. MIT Press, Elsevier"},{"key":"1126_CR31","unstructured":"Faliszewski P, Slinko A, Stahl K, Talmon N (2016) Achieving fully proportional representation by clustering voters. In: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, pp 296\u2013304"},{"issue":"4","key":"1126_CR32","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of $$\\ln n$$ ln n for approximating set cover. J ACM 45(4):634\u2013652","journal-title":"J ACM"},{"issue":"3","key":"1126_CR33","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0141041","volume":"41","author":"P Fishburn","year":"1981","unstructured":"Fishburn P (1981a) An analysis of simple voting systems for electing committees. SIAM J Appl Math 41(3):499\u2013502","journal-title":"SIAM J Appl Math"},{"issue":"2","key":"1126_CR34","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0022-0531(81)90005-3","volume":"25","author":"P Fishburn","year":"1981","unstructured":"Fishburn P (1981b) Majority committees. J Econ Theory 25(2):255\u2013268","journal-title":"J Econ Theory"},{"key":"1126_CR35","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, New York"},{"key":"1126_CR36","doi-asserted-by":"crossref","unstructured":"Khuller S, Saha B (2009) On finding dense subgraphs. In: Proceedings of the 36th International Colloquium on Automata, Languages, and Programming, pp 597\u2013608","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"1126_CR37","first-page":"105","volume-title":"Studies in Choice and Welfare","author":"D. Marc Kilgour","year":"2010","unstructured":"Kilgour M (2010) Approval balloting for multi-winner elections. In: Handbook on approval voting, Ch.\u00a06. Springer, New York"},{"issue":"2","key":"1126_CR38","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/972639.972644","volume":"51","author":"J Kleinberg","year":"2004","unstructured":"Kleinberg J, Papadimitriou C, Raghavan P (2004) Segmentation problems. J ACM 51(2):263\u2013280","journal-title":"J ACM"},{"key":"1126_CR39","doi-asserted-by":"crossref","unstructured":"Lackner M, Skowron P (April 2017) Consistent approval-based multi-winner rules. Technical Report arXiv:1704.02453 [cs.GT]","DOI":"10.24963\/ijcai.2018\/47"},{"key":"1126_CR40","doi-asserted-by":"crossref","unstructured":"Lang J, Xia L (2015) Voting in combinatorial domains. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of computational social choice, ch.\u00a09. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9781107446984.010"},{"key":"1126_CR41","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-20441-8_13","volume-title":"Electoral systems: paradoxes, assumptions, and procedures","author":"J Laslier","year":"2012","unstructured":"Laslier J (2012) And the loser is... plurality voting. In: Felsenthal D, Machover M (eds) Electoral systems: paradoxes, assumptions, and procedures. Springer, New York, pp 327\u2013351"},{"key":"1126_CR42","unstructured":"LeGrand R (2004) Analysis of the minimax procedure. Technical Report WUCSE-2004-67, Department of Computer Science and Engineering, Washington University"},{"issue":"4","key":"1126_CR43","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H Lenstra Jr","year":"1983","unstructured":"Lenstra H Jr (1983) Integer programming with a fixed number of variables. Math Oper Res 8(4):538\u2013548","journal-title":"Math Oper Res"},{"key":"1126_CR44","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198273479.001.0001","volume-title":"Electoral systems and party systems: a study of twenty-seven democracies, 1945\u20131990","author":"A Lijphart","year":"1994","unstructured":"Lijphart A, Aitkin D (1994) Electoral systems and party systems: a study of twenty-seven democracies, 1945\u20131990. Oxford University Press, Oxford"},{"key":"1126_CR45","unstructured":"Lu T, Boutilier C (2011) Budgeted social choice: From consensus to personalized decision making. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp 280\u2013286"},{"key":"1126_CR46","doi-asserted-by":"crossref","unstructured":"Lu T, Boutilier C (2015) Value-directed compression of large-scale assignment problems. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp 1182\u20131190","DOI":"10.1609\/aaai.v29i1.9364"},{"key":"1126_CR47","unstructured":"Misra N, Nabeel A, Singh H (2015) On the parameterized complexity of minimax approval voting. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, pp 97\u2013105"},{"issue":"4","key":"1126_CR48","doi-asserted-by":"publisher","first-page":"925","DOI":"10.2307\/2082518","volume":"89","author":"B Monroe","year":"1995","unstructured":"Monroe B (1995) Fully proportional representation. Am Polit Sci Rev 89(4):925\u2013940","journal-title":"Am Polit Sci Rev"},{"issue":"1","key":"1126_CR49","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser G, Wolsey L, Fisher M (1978) An analysis of approximations for maximizing submodular set functions. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"1126_CR50","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford University Press, Oxford"},{"key":"1126_CR51","doi-asserted-by":"crossref","unstructured":"Oren J, Lucier B (2014) Online (budgeted) social choice. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp 1456\u20131462","DOI":"10.1609\/aaai.v28i1.8891"},{"key":"1126_CR52","doi-asserted-by":"crossref","unstructured":"Peters D (2018) Single-peakedness and total unimodularity: new polynomial-time algorithms for multi-winner elections. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (to appear)","DOI":"10.1609\/aaai.v32i1.11460"},{"key":"1126_CR53","doi-asserted-by":"crossref","unstructured":"Peters D, Lackner M (2017) Preferences single-peaked on a circle. In: Proceedings of the 31st AAAI conference on artificial intelligence, pp 649\u2013655","DOI":"10.1609\/aaai.v31i1.10615"},{"issue":"3","key":"1126_CR54","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","volume":"30","author":"A Procaccia","year":"2008","unstructured":"Procaccia A, Rosenschein J, Zohar A (2008) On the complexity of achieving proportional representation. Soc Choice Welfare 30(3):353\u2013362","journal-title":"Soc Choice Welfare"},{"key":"1126_CR55","doi-asserted-by":"crossref","unstructured":"Raghavendra P, Steurer D (2010) Graph expansion and the unique games conjecture. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp 755\u2013764","DOI":"10.1145\/1806689.1806792"},{"key":"1126_CR56","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Fern\u00e1ndez L, Elkind E, Lackner M, Fern\u00e1ndez N, Fisteus JA, Val P.\u00a0Basanta, Skowron P (2017) Proportional justified representation. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence, pp 670\u2013676","DOI":"10.1609\/aaai.v31i1.10611"},{"key":"1126_CR57","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-319-55849-3_18","volume-title":"Applications of Evolutionary Computation","author":"Jakub Sawicki","year":"2017","unstructured":"Sawicki J, Smolka M, \u0141o\u015b M, Schaefer R, Faliszewski P (2017) Two-phase strategy managing insensitivity in global optimization. In: Proceedings of the 20th International Conference on the Applications of Evolutionary Computation, pp 266\u2013281"},{"key":"1126_CR58","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-662-54110-4_23","volume-title":"Web and Internet Economics","author":"Piotr Skowron","year":"2016","unstructured":"Skowron P (2016) FPT approximation schemes for maximizing submodular functions. In: Proceedings of the 12th Conference on Web and Internet Economics, pp 324\u2013338"},{"key":"1126_CR59","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1613\/jair.5628","volume":"60","author":"P Skowron","year":"2017","unstructured":"Skowron P, Faliszewski P (2017) Chamberlin-courant rule with approval ballots: approximating the maxcover problem with bounded frequencies in FPT time. J Artif Intell Res 60:687\u2013716","journal-title":"J Artif Intell Res"},{"key":"1126_CR60","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.artint.2016.09.003","volume":"241","author":"P Skowron","year":"2016","unstructured":"Skowron P, Faliszewski P, Lang J (2016) Finding a collective set of items: from proportional multirepresentation to group recommendation. Artif Intell 241:191\u2013216","journal-title":"Artif Intell"},{"key":"1126_CR61","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.artint.2015.01.003","volume":"222","author":"P Skowron","year":"2015","unstructured":"Skowron P, Faliszewski P, Slinko A (2015a) Achieving fully proportional representation: approximability result. Artif Intell 222:67\u2013103","journal-title":"Artif Intell"},{"key":"1126_CR62","unstructured":"Skowron P, Faliszewski P, Slinko A (April 2016) Axiomatic characterization of committee scoring rules. Technical Report arXiv:1604.01529 [cs.GT]"},{"key":"1126_CR63","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2014.12.012","volume":"569","author":"P Skowron","year":"2015","unstructured":"Skowron P, Yu L, Faliszewski P, Elkind E (2015b) The complexity of fully proportional representation for single-crossing electorates. Theor Comput Sci 569:43\u201357","journal-title":"Theor Comput Sci"},{"key":"1126_CR64","unstructured":"Thiele T (1895) Om flerfoldsvalg. In: Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger, pp 415\u2013441"},{"issue":"1","key":"1126_CR65","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"R Yager","year":"1988","unstructured":"Yager R (1988) On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Trans Syst Man Cybern 18(1):183\u2013190","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"1126_CR66","unstructured":"Yu L, Chan H, Elkind E (2013) Multiwinner elections under preferences that are single-peaked on a tree. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp 425\u2013431"},{"key":"1126_CR67","volume-title":"Facility location: concepts, models, and case studies","year":"2009","unstructured":"Zanjirani F, Hekmatfar M (eds) (2009) Facility location: concepts, models, and case studies. Springer, New York"}],"container-title":["Social Choice and Welfare"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00355-018-1126-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-018-1126-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-018-1126-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T19:44:58Z","timestamp":1751571898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00355-018-1126-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,19]]},"references-count":67,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["1126"],"URL":"https:\/\/doi.org\/10.1007\/s00355-018-1126-4","relation":{},"ISSN":["0176-1714","1432-217X"],"issn-type":[{"value":"0176-1714","type":"print"},{"value":"1432-217X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,19]]},"assertion":[{"value":"12 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}