{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T17:21:48Z","timestamp":1764350508204,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030314880"},{"type":"electronic","value":"9783030314897"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31489-7_2","type":"book-chapter","created":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T23:04:53Z","timestamp":1570662293000},"page":"17-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Robustness of Approval-Based Multiwinner Voting Rules"],"prefix":"10.1007","author":[{"given":"Grzegorz","family":"Gawron","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,10]]},"reference":[{"issue":"2","key":"2_CR1","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.: Justified representation in approval-based committee voting. Soc. Choice Welfare 48 (2), 461\u2013485 (2017)","journal-title":"Soc. Choice Welfare"},{"key":"2_CR2","unstructured":"Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., Walsh, T.: Computational aspects of multi-winner approval voting. In: Proceedings of AAMAS 2015, pp. 107\u2013115 (2015)"},{"key":"2_CR3","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.: On the computation of fully proportional representation. J. Artif. Intell. Res. 47 , 475\u2013519 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05158-1_18","volume-title":"Voting Power and Procedures","author":"S Brams","year":"2014","unstructured":"Brams, S., Kilgour, D.: Satisfaction approval voting. In: Fara, R., Leech, D., Salles, M. (eds.) Voting Power and Procedures. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05158-1_18"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-319-66700-3_7","volume-title":"Algorithmic Game Theory","author":"R Bredereck","year":"2017","unstructured":"Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Niedermeier, R., Skowron, P., Talmon, N.: Robustness among multiwinner voting rules. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 80\u201392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_7"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1177\/0951629818775518","volume":"30","author":"M Brill","year":"2018","unstructured":"Brill, M., Laslier, J., Skowron, P.: Multiwinner approval rules as apportionment methods. J. Theor. Polit. 30 (3), 358\u2013382 (2018)","journal-title":"J. Theor. Polit."},{"key":"2_CR7","unstructured":"Byrka, J., Skowron, P., Sornat, K.: Proportional approval voting, harmonic $$k$$ -median, and negative association. In: Proceedings of ICALP 2018, pp. 26:1\u201326:14 (2018)"},{"key":"2_CR8","unstructured":"Cary, D.: Estimating the margin of victory for instant-runoff voting. In: Presented at 2011 electronic voting technology workshop\/workshop on trushworthy elections, August 2011"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"B Chamberlin","year":"1983","unstructured":"Chamberlin, B., Courant, P.: Representative deliberations and representative decisions: proportional representation and the Borda rule. Am. Polit. Sci. Rev. 77 (3), 718\u2013733 (1983)","journal-title":"Am. Polit. Sci. Rev."},{"key":"2_CR10","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"},{"key":"2_CR11","unstructured":"Dey, P., Narahari, Y.: Estimating the margin of victory of an election using sampling. In: Proceedings of IJCAI-2015, pp. 1120\u20131126 (2015)"},{"issue":"3","key":"2_CR12","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)","journal-title":"Soc. Choice Welfare"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1613\/jair.2697","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Llull and Copeland voting computationally resist bribery and constructive control. J. Artif. Intell. Res. 35 , 275\u2013341 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR14","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner voting: a new challenge for social choice theory. In: Endriss, U. (ed.) Trends in Computational Social Choice. AI Access Foundation (2017)"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00355-018-1126-4","volume":"51","author":"P Faliszewski","year":"2018","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner analogues of the plurality rule: axiomatic and algorithmic views. Soc. Choice Welfare 51 (3), 513\u2013550 (2018)","journal-title":"Soc. Choice Welfare"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3296672","volume":"7","author":"Piotr Faliszewski","year":"2019","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Committee scoring rules: axiomatic characterization and hierarchy. ACM Trans. Econ. Comput. 6 (1), Article 3 (2019)","journal-title":"ACM Transactions on Economics and Computation"},{"key":"2_CR17","unstructured":"Faliszewski, P., Skowron, P., Talmon, N.: Bribery as a measure of candidate success: complexity results for approval-based multiwinner rules. In: Proceedings of AAMAS 2017, pp. 6\u201314 (2017)"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2012.04.009","volume":"189","author":"N Hazon","year":"2012","unstructured":"Hazon, N., Aumann, Y., Kraus, S., Wooldridge, M.: On the evaluation of election outcomes under uncertainty. Artif. Intell. 189 , 1\u201318 (2012)","journal-title":"Artif. Intell."},{"key":"2_CR19","unstructured":"Kaczmarczyk, A., Faliszewski, P.: Algorithms for destructive shift bribery. In: Proceedings of AAMAS 2016, pp. 305\u2013313 (2016)"},{"key":"2_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02839-7_6","volume-title":"Handbook on Approval Voting","author":"M Kilgour","year":"2010","unstructured":"Kilgour, M.: Approval balloting for multi-winner elections. In: Laslier, J.F., Sanver, M. (eds.) Handbook on Approval Voting. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02839-7_6"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Lackner, M., Skowron, P.: Consistent approval-based multi-winner rules. In: Proceedings of EC 2018, pp. 47\u201348 (2018)","DOI":"10.1145\/3219166.3219170"},{"key":"2_CR22","unstructured":"Lu, T., Boutilier, C.: Budgeted social choice: from consensus to personalized decision making. In: Proceedings of IJCAI 2011, pp. 280\u2013286 (2011)"},{"key":"2_CR23","unstructured":"Magrino, T., Rivest, R., Shen, E., Wagner, D.: Computing the margin of victory in IRV elections. In: Presented at 2011 electronic voting technology workshop\/workshop on trushworthy elections, August 2011"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-10801-4_27","volume-title":"SOFSEM 2019: Theory and Practice of Computer Science","author":"Neeldhara Misra","year":"2019","unstructured":"Misra, N., Sonar, C.: Robustness radius for Chamberlin-Courant on restricted domains. In: Proceedings of SOFSEM 2019, pp. 341\u2013353 (2019)"},{"key":"2_CR25","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"3","key":"2_CR26","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.: On the complexity of achieving proportional representation. Soc. Choice Welfare 30 (3), 353\u2013362 (2008)","journal-title":"Soc. Choice Welfare"},{"key":"2_CR27","unstructured":"Shiryaev, D., Yu, L., Elkind, E.: On elections with robust winners. In: Proceedings of AAMAS 2013, pp. 415\u2013422 (2013)"},{"key":"2_CR28","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.: Finding a collective set of items: from proportional multirepresentation to group recommendation. Artif. Intell. 241 , 191\u2013216 (2016)","journal-title":"Artif. Intell."},{"key":"2_CR29","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.: Achieving fully proportional representation: approximability result. Artif. Intell. 222 , 67\u2013103 (2015)","journal-title":"Artif. Intell."},{"key":"2_CR30","unstructured":"Thiele, T.: Om flerfoldsvalg. In: Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger, pp. 415\u2013441 (1895)"},{"issue":"2","key":"2_CR31","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theoret. Comput. Sci. 8 (2), 189\u2013201 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Wojtas, K., Faliszewski, P.: Possible winners in noisy elections. In: Proceedings of AAAI 2012, pp. 1499\u20131505, July 2012","DOI":"10.1609\/aaai.v26i1.8255"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: Proceedings of EC 2012, pp. 982\u2013999. ACM Press, June 2012","DOI":"10.1145\/2229012.2229086"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31489-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T08:59:52Z","timestamp":1664614792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31489-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030314880","9783030314897"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31489-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham, NC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.fuqua.duke.edu\/adt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","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":"10","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":"7","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":"32% - 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","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}