{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T17:01:30Z","timestamp":1762102890659,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ONR","award":["N00014-19-1-2268"],"award-info":[{"award-number":["N00014-19-1-2268"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1637397"],"award-info":[{"award-number":["CCF-1637397"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DARPA","award":["FA8650-18-C-7880"],"award-info":[{"award-number":["FA8650-18-C-7880"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467624","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:50Z","timestamp":1626604130000},"page":"697-717","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Algorithms for Multiwinner Elections and the Chamberlin-Courant Rule"],"prefix":"10.1145","author":[{"given":"Kamesh","family":"Munagala","sequence":"first","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyu","family":"Shen","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangning","family":"Wang","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-019-01208-3"},{"key":"e_1_3_2_1_3_1","first-page":"317","article-title":"Weighted Voting Doesn't Work: A Mathematical Analysis","volume":"19","author":"Banzhaf J.","year":"1965","unstructured":"J. Banzhaf . 1965 . Weighted Voting Doesn't Work: A Mathematical Analysis . Rutgers Law Review , Vol. 19 , 2 (1965), 317 -- 343 . J. Banzhaf. 1965. Weighted Voting Doesn't Work: A Mathematical Analysis. Rutgers Law Review, Vol. 19, 2 (1965), 317--343.","journal-title":"Rutgers Law Review"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45771-6_6"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13--17","author":"Brill Markus","year":"2019","unstructured":"Markus Brill , Piotr Faliszewski , Frank Sommer , and Nimrod Talmon . 2019 . Approximation Algorithms for BalancedCC Multiwinner Rules . In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13--17 , 2019. International Foundation for Autonomous Agents and Multiagent Systems, 494--502. Markus Brill, Piotr Faliszewski, Frank Sommer, and Nimrod Talmon. 2019. Approximation Algorithms for BalancedCC Multiwinner Rules. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13--17, 2019. International Foundation for Autonomous Agents and Multiagent Systems, 494--502."},{"key":"e_1_3_2_1_6_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming, ICALP (LIPIcs","volume":"14","author":"Byrka Jaroslaw","year":"2018","unstructured":"Jaroslaw Byrka , Piotr Skowron , and Krzysztof Sornat . 2018 . Proportional Approval Voting, Harmonic k-median, and Negative Association. In 45th International Colloquium on Automata, Languages, and Programming, ICALP (LIPIcs , Vol. 107). 26:1--26: 14 . Jaroslaw Byrka, Piotr Skowron, and Krzysztof Sornat. 2018. Proportional Approval Voting, Harmonic k-median, and Negative Association. In 45th International Colloquium on Automata, Languages, and Programming, ICALP (LIPIcs, Vol. 107). 26:1--26:14."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/1957270"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1882"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3417750"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.2.99"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-017-1026-z"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11459"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"volume-title":"Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS. 323--332","author":"Gandhi R.","key":"e_1_3_2_1_15_1","unstructured":"R. Gandhi , S. Khuller , S. Parthasarathy , and A. Srinivasan . 2002. Dependent rounding in bipartite graphs . In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS. 323--332 . R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan. 2002. Dependent rounding in bipartite graphs. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS. 323--332."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340230"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854153"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384238"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129787"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI. 280--286","author":"Lu Tyler","year":"2011","unstructured":"Tyler Lu and Craig Boutilier . 2011 . Budgeted Social Choice: From Consensus to Personalized Decision Making . In Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI. 280--286 . Tyler Lu and Craig Boutilier. 2011. Budgeted Social Choice: From Consensus to Personalized Decision Making. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI. 280--286."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_2_1_23_1","unstructured":"PBP. 2016. Where has it worked? - The Participatory Budgeting Project. http:\/\/www.participatorybudgeting.org\/about-participatory-budgeting\/where-has-it-worked\/.  PBP. 2016. Where has it worked? - The Participatory Budgeting Project. http:\/\/www.participatorybudgeting.org\/about-participatory-budgeting\/where-has-it-worked\/."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.09.003"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.01.003"},{"key":"e_1_3_2_1_26_1","volume-title":"Om flerfoldsvalg. Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger","author":"Thiele T. N.","year":"1895","unstructured":"T. N. Thiele . 1895. Om flerfoldsvalg. Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger ( 1895 ), 415--441. T. N. Thiele. 1895. Om flerfoldsvalg. Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger (1895), 415--441."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005082925477"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Budapest Hungary","acronym":"EC '21"},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467624","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467624","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":26,"alternative-id":["10.1145\/3465456.3467624","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467624","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}