{"type":"ScholarlyArticle","title":"Fine-Grained View on Bribery for Group Identification","authors":[{"name":"Niclas Boehmer","slug":"niclas-boehmer","given":"Niclas","family":"Boehmer","affiliation":"Technische Universität Berlin , Chair of Algorithmics and Computational Complexity"},{"name":"Robert Bredereck","slug":"robert-bredereck","given":"Robert","family":"Bredereck","affiliation":"Technische Universität Berlin , Chair of Algorithmics and Computational Complexity"},{"name":"Dušan Knop","slug":"dusan-knop","given":"Dušan","family":"Knop","affiliation":"Czech Technical University in Prague , Prague , Czech Republic"},{"name":"Junjie Luo","slug":"junjie-luo","given":"Junjie","family":"Luo","affiliation":"Technische Universität Berlin , Chair of Algorithmics and Computational Complexity"}],"abstract":"Given a set of individuals qualifying or disqualifying each other, group identification is the task of identifying a socially qualified subgroup of individuals. Social qualification depends on the specific rule used to aggregate individual qualifications. The bribery problem in this context asks how many agents need to change their qualifications in order to change the outcome.\r\n\r\nComplementing previous results showing polynomial-time solvability or NP-hardness of bribery for various social rules in the constructive (aiming at making specific individuals socially qualified) or destructive (aiming at making specific individuals socially disqualified) setting, we provide a comprehensive picture of the parameterized computational complexity landscape. Conceptually, we also consider a more fine-grained concept of bribery cost, where we ask how many single qualifications need to be changed, and a more general bribery goal that combines the constructive and destructive setting.","doi":"10.24963/ijcai.2020/10","url":"https://ijcai.org/proceedings/2020/10","pdf":"https://ijcai.org/proceedings/2020/0010.pdf","markdown":"https://ijcai.org/proceedings/2020/10.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/10","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":10,"pages":{"first":67,"last":73},"keywords":["Agent-based and Multi-agent Systems: Computational Social Choice","Agent-based and Multi-agent Systems: Voting"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25202/file_25202.m3u8","length_sec":297,"provider":"hls"}],"references":[{"position":1,"raw":"[Baumeister et al., 2011] Dorothea Baumeister, Gábor Erdélyi, and Jörg Rothe. How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation. In Algorithmic Decision Theory -Second International Conference (ADT '11), pages 1-15, 2011.","title":"How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation","authors":"Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe","year":"2011","venue":"Algorithmic Decision Theory -Second International Conference (ADT '11)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bredereck et al., 2016] Robert Bredereck, Piotr Fal- iszewski, Rolf Niedermeier, and Nimrod Talmon. Complexity of shift bribery in committee elections. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI '16), pages 2452-2458, 2016.","title":"Complexity of shift bribery in committee elections","authors":"Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon","year":"2016","venue":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI '16)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cary, 2011] David Cary. Estimating the margin of victory for instant-runoff voting. In 2011 Electronic Voting Tech- nology Workshop / Workshop on Trustworthy Elections (EVT/WOTE '11), 2011.","title":"Estimating the margin of victory for instant-runoff voting","authors":"David Cary","year":"2011","venue":"Electronic Voting Technology Workshop / Workshop on Trustworthy Elections (EVT/WOTE '11)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Dimitrov, 2011] Dinko Dimitrov. The social choice ap- proach to group identification. In Consensual Processes, pages 123-134. 2011.","title":"The social choice approach to group identification","authors":"Dinko Dimitrov","year":"2011","venue":"Consensual Processes","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Duddy et al., 2016] Conal Duddy, Ashley Piggins, and William S. Zwicker. Aggregation of binary evalua- tions: a borda-like approach. Social Choice and Welfare, 46(2):301-333, 2016.","title":"Aggregation of binary evaluations: a borda-like approach","authors":"Conal Duddy, Ashley Piggins, William S Zwicker","year":"2016","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Eisenbrand and Weismantel, 2018] Friedrich Eisenbrand and Robert Weismantel. Proximity results and faster algorithms for integer programming using the steinitz lemma. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '18), pages 808-816, 2018.","title":"Friedrich Eisenbrand and Robert Weismantel. Proximity results and faster algorithms for integer programming using the steinitz lemma","authors":"Weismantel Eisenbrand","year":"2018","venue":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '18)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Erdélyi et al., 2020] Gábor Erdélyi, Christian Reger, and Yongjie Yang. The complexity of bribery and control in group identification. Autonomous Agents and Multi-Agent Systems, 34(1):8, 2020.","title":"The complexity of bribery and control in group identification","authors":"Gábor Erdélyi, Christian Reger, Yongjie Yang","year":"2020","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Even, 1975] Shimon Even. An algorithm for determining whether the connectivity of a graph is at least k. SIAM J. Comput., 4(3):393-396, 1975.","title":"An algorithm for determining whether the connectivity of a graph is at least k","authors":"Shimon Even","year":"1975","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Faliszewski and Rothe, 2016] Piotr Faliszewski and Jörg Rothe. Control and bribery in voting. In Handbook of Computational Social Choice, pages 146-168. 2016.","title":"Control and bribery in voting","authors":"Piotr Faliszewski, Jörg Rothe","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Faliszewski et al., 2009a] Piotr Faliszewski, Edith Hemas- paandra, and Lane A. Hemaspaandra. How hard is bribery in elections? J. Artif. Intell. Res., 35:485-532, 2009.","title":"Piotr Faliszewski, Edith Hemaspaandra, and Lane A. Hemaspaandra. How hard is bribery in elections?","authors":"Faliszewski","year":"2009","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Faliszewski et al., 2009b] Piotr Faliszewski, Edith Hemas- paandra, Lane A. Hemaspaandra, and Jörg Rothe. Llull and copeland voting computationally resist bribery and constructive control. J. Artif. Intell. Res., 35:275-341, 2009.","title":"Llull and copeland voting computationally resist bribery and constructive control","authors":"Faliszewski","year":"2009","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Faliszewski et al., 2017a] Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, and Nimrod Talmon. Multiwinner voting: A new challenge for social choice theory. In Trends in Computational Social Choice, pages 27-47. 2017.","title":"Multiwinner voting: A new challenge for social choice theory","authors":"Faliszewski","year":"2017","venue":"Trends in Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Faliszewski et al., 2017b] Piotr Faliszewski, Piotr Skowron, and Nimrod Talmon. Bribery as a measure of candidate success: Complexity results for approval-based multiwin- ner rules. In Proceedings of the 16th Conference on Au- tonomous Agents and MultiAgent Systems (AAMAS '17), pages 6-14, 2017.","title":"Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules","authors":"Faliszewski","year":"2017","venue":"Proceedings of the 16th Conference on Au-tonomous Agents and MultiAgent Systems (AAMAS '17)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Faliszewski et al., 2017c] Piotr Faliszewski, Arkadii Slinko, and Nimrod Talmon. The complexity of multiwin- ner voting rules with variable number of winners. CoRR, abs/1711.06641, 2017.","title":"The complexity of multiwinner voting rules with variable number of winners","authors":"Faliszewski","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Fomin et al., 2004] Fedor V. Fomin, Dieter Kratsch, and Gerhard J. Woeginger. Exact (exponential) algorithms for the dominating set problem. In Graph-Theoretic Concepts in Computer Science, 30th International Workshop (WG '04), pages 245-256, 2004.","title":"Exact (exponential) algorithms for the dominating set problem","authors":"V Fedor, Dieter Fomin, Gerhard J Kratsch, Woeginger","year":"2004","venue":"Graph-Theoretic Concepts in Computer Science, 30th International Workshop (WG '04)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Karger and Stein, 1996] David R. Karger and Clifford Stein. A new approach to the minimum cut problem. J. ACM, 43(4):601-640, 1996.","title":"A new approach to the minimum cut problem","authors":"David R Karger, Clifford Stein","year":"1996","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kasher and Rubinstein, 1997] Asa Kasher and Ariel Rubin- stein. On the question \"who is a j?\" a social choice ap- proach. Logique et Analyse, 40(160):385-395, 1997.","title":"Asa Kasher and Ariel Rubinstein. On the question \"who is a j?\" a social choice approach","authors":"Rubinstein Kasher","year":"1997","venue":"Logique et Analyse","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kasher, 1993] Asa Kasher. Jewish collective identity. In Jewish Identity, pages 56-78. 1993.","title":"Asa Kasher. Jewish collective identity","authors":"Kasher","year":"1993","venue":"Jewish Identity","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kilgour, 2016] D Marc Kilgour. Approval elections with a variable number of winners. Theory and Decision, 81(2):199-211, 2016.","title":"Approval elections with a variable number of winners","authors":"Kilgour Marc","year":"2016","venue":"Theory and Decision","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Magrino et al., 2011] Thomas R. Magrino, Ronald L. Rivest, and Emily Shen. Computing the margin of vic- tory in IRV elections. In 2011 Electronic Voting Tech- nology Workshop / Workshop on Trustworthy Elections (EVT/WOTE '11), 2011.","title":"Computing the margin of victory in IRV elections","authors":"Thomas R Magrino, Ronald L Rivest, Emily Shen","year":"2011","venue":"Electronic Voting Technology Workshop / Workshop on Trustworthy Elections (EVT/WOTE '11)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Samet and Schmeidler, 2003] Dov Samet and David Schmeidler. Between liberalism and democracy. J. Economic Theory, 110(2):213-233, 2003.","title":"Between liberalism and democracy","authors":"Schmeidler Samet, Dov Samet, David Schmeidler","year":"2003","venue":"J. Economic Theory","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Xia, 2012] Lirong Xia. Computing the margin of victory for various voting rules. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC '12), pages 982- 999, 2012.","title":"Computing the margin of victory for various voting rules","authors":"Lirong Xia","year":"2012","venue":"Proceedings of the 13th ACM Conference on Electronic Commerce (EC '12)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Yang and Dimitrov, 2018] Yongjie Yang and Dinko Dim- itrov. How hard is it to control a group? Autonomous Agents and Multi-Agent Systems, 32(5):672-692, 2018.","title":"Yongjie Yang and Dinko Dimitrov. How hard is it to control a group?","authors":"Dimitrov Yang","year":"2018","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}