{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T17:26:43Z","timestamp":1764350803967,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206139"},{"type":"electronic","value":"9783031206146"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20614-6_7","type":"book-chapter","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T16:02:37Z","timestamp":1670688157000},"page":"116-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robustness of\u00a0Greedy Approval Rules"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Faliszewski","sequence":"first","affiliation":[]},{"given":"Grzegorz","family":"Gawron","sequence":"additional","affiliation":[]},{"given":"Bartosz","family":"Kusek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,11]]},"reference":[{"issue":"2","key":"7_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":"7_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 201, pp. 107\u2013115 (2015)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Hogrebe, T.: On the complexity of predicting election outcomes and estimating their robustness. In: Proceedings of EUMAS-2021, pp. 228\u2013244 (2021)","DOI":"10.1007\/978-3-030-82254-5_14"},{"key":"7_CR4","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":"7_CR5","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Bredereck, R., Faliszewski, P., Niedermeier, R.: Winner robustness via swap- and shift-bribery: parameterized counting complexity and experiments. In: Proceedings of IJCAI-2021, pp. 52\u201358 (2021)","DOI":"10.24963\/ijcai.2021\/8"},{"key":"7_CR6","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":"7_CR7","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":"7_CR8","unstructured":"Cary, D.: Estimating the margin of victory for instant-runoff voting (August 2011), In: Presented at 2011 Electronic Voting Technology Workshop\/Workshop on Trushworthy Elections (2011)"},{"issue":"3","key":"7_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. Pol. Sci. Rev. 77(3), 718\u2013733 (1983)","journal-title":"Am. Pol. Sci. Rev."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-04645-2_27","volume-title":"Algorithmic Game Theory","author":"E Elkind","year":"2009","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 299\u2013310. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04645-2_27"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR12","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, chap. 7. Cambridge University Press, Cambridge (2015)"},{"key":"7_CR13","doi-asserted-by":"publisher","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. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-031-09016-5_1","DOI":"10.1007\/978-3-031-09016-5_1"},{"key":"7_CR14","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":"7_CR15","doi-asserted-by":"crossref","unstructured":"Gawron, G., Faliszewski, P.: Robustness of approval-based multiwinner voting rules. In: Proceedings of ADT-2019, pp. 17\u201331 (2019)","DOI":"10.1007\/978-3-030-31489-7_2"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T Gonzalez","year":"1985","unstructured":"Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Lackner, M., Skowron, P.: Multi-winner voting with approval preferences. Tech. Rep. arxiv:2007.01795, arXiv.org (2022)","DOI":"10.1007\/978-3-031-09016-5"},{"key":"7_CR18","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"},{"issue":"3","key":"7_CR19","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 Welf. 30(3), 353\u2013362 (2008)","journal-title":"Soc. Choice Welf."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Fern\u00e1ndez, L., et al.: Proportional justified representation. In: Proceedings of AAAI-2017, pp. 670\u2013676 (2017)","DOI":"10.1609\/aaai.v31i1.10611"},{"key":"7_CR21","unstructured":"Shiryaev, D., Yu, L., Elkind, E.: On elections with robust winners. In: Proceedings of AAMAS-2013, pp. 415\u2013422 (2013)"},{"key":"7_CR22","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":"7_CR23","doi-asserted-by":"crossref","unstructured":"Szufa, S., et al.: How to sample approval elections? In: Proceedings of IJCAI-2022, pp. 496\u2013502 (2022)","DOI":"10.24963\/ijcai.2022\/71"},{"key":"7_CR24","unstructured":"Thiele, T.: Om flerfoldsvalg. In: Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger, pp. 415\u2013441 (1895)"},{"key":"7_CR25","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"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"R Yager","year":"1988","unstructured":"Yager, R.: On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Trans. Syst. Man Cybern. 18(1), 183\u2013190 (1988)","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20614-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T16:03:52Z","timestamp":1670688232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20614-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206139","9783031206146"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20614-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"D\u00fcsseldorf","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ccc.cs.hhu.de\/eumas2022\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","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":"23","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":"0","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":"64% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}