{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:31Z","timestamp":1740107071505,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T00:00:00Z","timestamp":1728864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1637397"],"award-info":[{"award-number":["1637397"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research Global","doi-asserted-by":"publisher","award":["N00014-19-1-2268"],"award-info":[{"award-number":["N00014-19-1-2268"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2113798"],"award-info":[{"award-number":["CCF-2113798"]}],"id":[{"id":"10.13039\/100000001","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":[[2025,2]]},"DOI":"10.1007\/s00355-024-01555-w","type":"journal-article","created":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T12:02:45Z","timestamp":1728907365000},"page":"143-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal algorithms for multiwinner elections and the Chamberlin\u2013Courant Rule"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2636-9650","authenticated-orcid":false,"given":"Kamesh","family":"Munagala","sequence":"first","affiliation":[]},{"given":"Zeyu","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Kangning","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,14]]},"reference":[{"key":"1555_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.artint.2018.07.006","volume":"264","author":"E Anshelevich","year":"2018","unstructured":"Anshelevich E, Bhardwaj O, Elkind E, Postl J, Skowron P (2018) Approximating optimal social choice under metric preferences. Artif Intell 264:27\u201351","journal-title":"Artif Intell"},{"issue":"3","key":"1555_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V Arya","year":"2004","unstructured":"Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit Vinayaka (2004) Local search heuristics for k-median and facility location problems. SIAM J Comput 33(3):544\u2013562","journal-title":"SIAM J Comput"},{"key":"1555_CR3","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: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI, pages 84\u201390. ijcai.org","DOI":"10.24963\/ijcai.2017\/13"},{"issue":"1","key":"1555_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00355-019-01208-3","volume":"54","author":"H Aziz","year":"2020","unstructured":"Aziz H, Lee BE (2020) The expanding approvals rule: improving proportional representation and monotonicity. Soc Choice Welf 54(1):1\u201345","journal-title":"Soc Choice Welf"},{"issue":"2","key":"1555_CR5","first-page":"317","volume":"19","author":"J Banzhaf","year":"1965","unstructured":"Banzhaf J (1965) Weighted voting doesn\u2019t work: a mathematical analysis. Rutgers Law Rev 19(2):317\u2013343","journal-title":"Rutgers Law Rev"},{"key":"1555_CR6","doi-asserted-by":"crossref","unstructured":"Barman S, Fawzi O, Ghoshal S, G\u00fcrp\u0131nar E (2020) Tight approximation bounds for maximum multi-coverage. In: International Conference on Integer Programming and Combinatorial Optimization, IPCO, pp. 66\u201377","DOI":"10.1007\/978-3-030-45771-6_6"},{"key":"1555_CR7","unstructured":"Brill M, Faliszewski P, Sommer F, Talmon N (2019) Approximation algorithms for balancedCC multiwinner rules. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS \u201919, Montreal, QC, Canada, May 13-17, 2019, pages 494\u2013502. International Foundation for Autonomous Agents and Multiagent Systems"},{"key":"1555_CR8","unstructured":"Byrka J, Skowron P, Sornat K (2018) Proportional approval voting, harmonic k-median, and negative association. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP, volume 107 of LIPIcs, pages 26:1\u201326:14"},{"issue":"3","key":"1555_CR9","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"JR Chamberlin","year":"1983","unstructured":"Chamberlin JR, Courant PN (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"},{"issue":"1","key":"1555_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcss.2002.1882","volume":"65","author":"M Charikar","year":"2002","unstructured":"Charikar M, Guha S, Tardos \u00c9, Shmoys DB (2002) A constant-factor approximation algorithm for the k-median problem. J Comput Syst Sci 65(1):129\u2013149","journal-title":"J Comput Syst Sci"},{"key":"1555_CR11","doi-asserted-by":"crossref","unstructured":"Charikar M, Wang K, Ramakrishnan P, Wu H (2024) Breaking the metric voting distortion barrier. In: Proceedings of the 35th ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 1621\u20131640. SIAM","DOI":"10.1137\/1.9781611977912.65"},{"issue":"4","key":"1555_CR12","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/3417750","volume":"8","author":"Y Cheng","year":"2020","unstructured":"Cheng Y, Jiang Z, Munagala K, Wang K (2020) Group fairness in committee selection. ACM Trans Econ Comput 8(4):23:1-23:18","journal-title":"ACM Trans Econ Comput"},{"key":"1555_CR13","unstructured":"Cornu\u00e9jols G, Nemhauser G, Wolsey L (1983) The uncapacitated facility location problem. In: Technical report, Cornell University Operations Research and Industrial Engineering"},{"issue":"2","key":"1555_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/moor.4.2.99","volume":"4","author":"P Dubey","year":"1979","unstructured":"Dubey P, Shapley LS (1979) Mathematical properties of the Banzhaf power index. Math Oper Res 4(2):99\u2013131","journal-title":"Math Oper Res"},{"key":"1555_CR15","unstructured":"Elkind E, Faliszewski P, Laslier J-F, Skowron P, Slinko A, Talmon N (2019) What do multiwinner voting rules do? An experiment over the two-dimensional euclidean domain"},{"issue":"3","key":"1555_CR16","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 Welf 48(3):599\u2013632","journal-title":"Soc Choice Welf"},{"key":"1555_CR17","doi-asserted-by":"crossref","unstructured":"Faliszewski P, Lackner M, Peters D, Talmon N (2018) Effective heuristics for committee scoring rules. In: Proceedings of the AAAI Conference on Artificial Intelligence. AAAI 32(1)","DOI":"10.1609\/aaai.v32i1.11459"},{"issue":"4","key":"1555_CR18","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$$ for approximating set cover. J ACM 45(4):634\u2013652","journal-title":"J ACM"},{"issue":"3","key":"1555_CR19","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R Gandhi","year":"2006","unstructured":"Gandhi R, Khuller S, Parthasarathy S, Srinivasan A (2006) Dependent rounding and its applications to approximation algorithms. J ACM 53(3):324\u2013360","journal-title":"J ACM"},{"key":"1555_CR20","doi-asserted-by":"crossref","unstructured":"Gkatzelis V, Halpern D, Shah N (2020) Resolving the optimal metric distortion conjecture. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS, pages 1427\u20131438. IEEE","DOI":"10.1109\/FOCS46700.2020.00134"},{"key":"1555_CR21","doi-asserted-by":"crossref","unstructured":"Goel A, Krishnaswamy AK, Sakshuwong S, Aitamurto T (2019) Knapsack voting for participatory budgeting. ACM Trans Econ Comput 7(2)","DOI":"10.1145\/3340230"},{"key":"1555_CR22","doi-asserted-by":"crossref","unstructured":"Hajiaghayi M, Hu W, Li J, Li S, Saha B (2016) A constant factor approximation algorithm for fault-tolerant k-median. ACM Trans Algorithms 12(3)","DOI":"10.1145\/2854153"},{"issue":"2","key":"1555_CR23","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K Jain","year":"2001","unstructured":"Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J ACM 48(2):274\u2013296","journal-title":"J ACM"},{"key":"1555_CR24","doi-asserted-by":"crossref","unstructured":"Jiang Z, Munagala K, Wang K (2020) Approximately stable committee selection. In: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC, pages 463\u2013472","DOI":"10.1145\/3357713.3384238"},{"key":"1555_CR25","doi-asserted-by":"crossref","unstructured":"Kizilkaya FE, Kempe D (2022) Plurality veto: a simple voting rule achieving optimal metric distortion. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI, pages 349\u2013355. ijcai.org","DOI":"10.24963\/ijcai.2022\/50"},{"key":"1555_CR26","doi-asserted-by":"crossref","unstructured":"Lin J.-H., Vitter J.S. (1992) $$\\epsilon $$-approximations with minimum packing constraint violation. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC, page 771-782","DOI":"10.1145\/129712.129787"},{"key":"1555_CR27","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, IJCAI, pp. 280-286"},{"key":"1555_CR28","doi-asserted-by":"crossref","unstructured":"Munagala K, Wang K (2019) Improved metric distortion for deterministic social choice rules. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC, pages 245\u2013262. ACM","DOI":"10.1145\/3328526.3329550"},{"issue":"1","key":"1555_CR29","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions\u2013I. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"1555_CR30","unstructured":"PBP (2016) Where has it worked?\u2014the participatory budgeting project. http:\/\/www.participatorybudgeting.org\/about-participatory-budgeting\/where-has-it-worked\/"},{"key":"1555_CR31","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 (2015) Achieving fully proportional representation: approximability results. Artif Intell 222:67\u2013103","journal-title":"Artif Intell"},{"key":"1555_CR32","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":"1555_CR33","doi-asserted-by":"crossref","unstructured":"Sornat K, Virginia VW, Xu Y (2022) Near-tight algorithms for the chamberlin-courant and thiele voting rules. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI, pages 482\u2013488. ijcai.org","DOI":"10.24963\/ijcai.2022\/69"},{"key":"1555_CR34","unstructured":"Thiele Thorvald\u00a0N (1895) Om flerfoldsvalg. In: Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger, pp. 415\u2013441"},{"issue":"1","key":"1555_CR35","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1005082925477","volume":"103","author":"N Tideman","year":"2000","unstructured":"Tideman N, Richardson D (2000) Better voting methods through technology: the refinement-manageability trade-off in the single transferable vote. Pub Choice 103(1):13\u201334","journal-title":"Pub Choice"}],"container-title":["Social Choice and Welfare"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-024-01555-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00355-024-01555-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-024-01555-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T15:04:31Z","timestamp":1737990271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00355-024-01555-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,14]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1555"],"URL":"https:\/\/doi.org\/10.1007\/s00355-024-01555-w","relation":{},"ISSN":["0176-1714","1432-217X"],"issn-type":[{"type":"print","value":"0176-1714"},{"type":"electronic","value":"1432-217X"}],"subject":[],"published":{"date-parts":[[2024,10,14]]},"assertion":[{"value":"12 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}