{"type":"ScholarlyArticle","title":"A Parameterized Perspective on Protecting Elections","authors":[{"name":"Palash Dey","slug":"palash-dey","given":"Palash","family":"Dey","affiliation":"Indian Institute of Technology , Kharagpur , India"},{"name":"Neeldhara Misra","slug":"neeldhara-misra","given":"Neeldhara","family":"Misra","affiliation":"Indian Institute of Technology , Gandhinagar , India"},{"name":"Swaprava Nath","slug":"swaprava-nath","given":"Swaprava","family":"Nath","affiliation":"Indian Institute of Technology , Kanpur , India"},{"name":"Garima Shakya","slug":"garima-shakya","given":"Garima","family":"Shakya","affiliation":"Indian Institute of Technology , Kanpur , India"}],"abstract":"We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers k_a and k_d corresponding to respectively the number of voter groups the attacker can attack and the number of voter groups the defender can defend. A voter group gets removed from the election if it is attacked but not defended. In the optimal defense problem, we want to know if it is possible for the defender to commit to a strategy of defending at most k_d voter groups such that, no matter which k_a voter groups the attacker attacks, the out-come of the election does not change. In the optimal attack problem, we want to know if it is possible for the attacker to commit to a strategy of attacking k_a voter groups such that, no matter which k_d voter groups the defender defends, the outcome of the election is always different from the original (without any attack) one. We show that both the optimal defense problem and the optimal attack problem are computationally intractable for every scoring rule and the Condorcet voting rule even when we have only3candidates. We also show that the optimal defense problem for every scoring rule and the Condorcet voting rule is W[2]-hard for both the parameters k_a and k_d, while it admits a fixed parameter tractable algorithm parameterized by the combined parameter (ka, kd). The optimal attack problem for every scoring rule and the Condorcet voting rule turns out to be much harder – it is W[1]-hard even for the combined parameter (ka, kd). We propose two greedy algorithms for the OPTIMAL DEFENSE problem and empirically show that they perform effectively on reasonable voting profiles.","doi":"10.24963/ijcai.2019/34","url":"https://ijcai.org/proceedings/2019/34","pdf":"https://ijcai.org/proceedings/2019/0034.pdf","markdown":"https://ijcai.org/proceedings/2019/34.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/34","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":34,"pages":{"first":238,"last":244},"keywords":["Agent-based and Multi-agent Systems: Algorithmic Game Theory","Agent-based and Multi-agent Systems: Computational Social Choice","Agent-based and Multi-agent Systems: Voting"],"videos":[],"references":[{"position":1,"raw":"[An et al., 2013] Bo An, Matthew Brown, Yevgeniy Vorobeychik, and Milind Tambe. Security games with surveillance cost and optimal timing of attack execution. In International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '13, Saint Paul, MN, USA, May 6-10, 2013, pages 223-230, 2013.","title":"Security games with surveillance cost and optimal timing of attack execution","authors":"Bo An, Matthew Brown, Yevgeniy Vorobeychik, Milind Tambe","year":"2013","venue":"International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '13","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bartholdi et al., 1992] John J. Bartholdi, Craig A. Tovey, and Michael A. Trick. How hard is it to control an election? Mathe- matical and Computer Modelling, 16(8):27 -40, 1992.","title":"How hard is it to control an election?","authors":"John J Bartholdi, Craig A Tovey, Michael A Trick","year":"1992","venue":"Mathematical and Computer Modelling","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baumeister et al., 2011] Dorothea Baumeister, Magnus Roos, and Jörg Rothe. Computational complexity of two variants of the possible winner problem. In The 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 853-860, 2011.","title":"Computational complexity of two variants of the possible winner problem","authors":"Baumeister","year":"2011","venue":"The 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Betzler and Uhlmann, 2009] Nadja Betzler and Johannes Uhlmann. Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci., 410(52):5425-5442, 2009.","title":"Parameterized complexity of candidate control in elections and related digraph problems","authors":"Uhlmann Betzler, Nadja Betzler, Johannes Uhlmann","year":"2009","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bhattacharjya, 2010] Satarupa Bhattacharjya. Low turnout and invalid votes mark first post war general polls. http://www. sundaytimes.lk/100411/News/nws 16.html, 2010.","title":"Low turnout and invalid votes mark first post war general polls","authors":"Satarupa Bhattacharjya","year":"2010","venue":null,"doi":null,"url":"http://www.sundaytimes.lk/100411/News/nws16.html","internal_url":null},{"position":6,"raw":"[Brandt et al., 2016] Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel Procaccia. Handbook of computational social choice, 2016.","title":"Handbook of computational social choice","authors":"Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel Procaccia","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cormen et al., 2009] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3rd edition, 2009.","title":"Introduction to Algorithms, Third Edition","authors":"H Thomas, Charles E Cormen, Ronald L Leiserson, Clifford Rivest, Stein","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Cygan et al., 2015] Marek Cygan, Fedor V. Fomin, Lukasz Kowa- lik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"Marek Cygan, V Fedor, Lukasz Fomin, Daniel Kowalik, Dániel Lokshtanov, Marcin Marx, Michal Pilipczuk, Saket Pilipczuk, Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dey and Misra, 2017] Palash Dey and Neeldhara Misra. On the exact amount of missing information that makes finding possi- ble winners hard. In Proc. 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS, pages 57:1-57:14, 2017.","title":"On the exact amount of missing information that makes finding possible winners hard","authors":"Misra Dey, Palash Dey, Neeldhara Misra","year":"2017","venue":"Proc. 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dey et al., 2015] Palash Dey, Neeldhara Misra, and Y. Narahari. Detecting possible manipulators in elections. In Proc. Interna- tional Conference on Autonomous Agents and Multiagent Sys- tems, AAMAS, pages 1441-1450, 2015.","title":"Detecting possible manipulators in elections","authors":"Palash Dey, Neeldhara Misra, Y Narahari","year":"2015","venue":"Proc. International Conference on Autonomous Agents and Multiagent Systems, AAMAS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dey et al., 2016] Palash Dey, Neeldhara Misra, and Y. Narahari. Kernelization complexity of possible winner and coalitional ma- nipulation problems in voting. Theor. Comput. Sci., 616:111- 125, 2016.","title":"Kernelization complexity of possible winner and coalitional manipulation problems in voting","authors":"Palash Dey, Neeldhara Misra, Y Narahari","year":"2016","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dey et al., 2017] Palash Dey, Neeldhara Misra, and Y. Narahari. Frugal bribery in voting. Theor. Comput. Sci., 676:15-32, 2017.","title":"Frugal bribery in voting","authors":"Palash Dey, Neeldhara Misra, Y Narahari","year":"2017","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Dey et al., 2018] Palash Dey, Neeldhara Misra, and Y. Narahari. Complexity of manipulation with partial information in voting. Theor. Comput. Sci., 726:78-99, 2018.","title":"Complexity of manipulation with partial information in voting","authors":"Palash Dey, Neeldhara Misra, Y Narahari","year":"2018","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Dey et al., 2019a] Palash Dey, Neeldhara Misra, and Y. Narahari. Parameterized dichotomy of choosing committees based on ap- proval votes in the presence of outliers. Theor. Comput. Sci., 2019.","title":"Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers","authors":"Dey","year":"2019","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Dey et al., 2019b] Palash Dey, Neeldhara Misra, Swaprava Nath, and Garima Shakya. A parameterized perspective on protecting elections. CoRR, abs/1905.11838, 2019.","title":"A parameterized perspective on protecting elections","authors":"Dey","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Dey, 2018] Palash Dey. Manipulative elicitation -A new attack on elections with incomplete preferences. Theor. Comput. Sci., 731:36-49, 2018.","title":"Manipulative elicitation -A new attack on elections with incomplete preferences","authors":"Palash Dey","year":"2018","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Dey, 2019] Palash Dey. Local distance restricted bribery in voting. In Proc. 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS, pages 1925-1927, 2019.","title":"Local distance restricted bribery in voting","authors":"Palash Dey, Dey","year":"2019","venue":"Proc. 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Downey and Fellows, 1999] Rod G Downey and Michael Ralph Fellows. Parameterized Complexity, volume 3. springer Hei- delberg, 1999.","title":"Rod G Downey and Michael Ralph Fellows","authors":"Fellows Downey","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Faliszewski et al., 2011] Piotr Faliszewski, Edith Hemaspaandra, and Lane A. Hemaspaandra. Multimode control attacks on elec- tions. J. Artif. Intell. Res. (JAIR), 40:305-351, 2011.","title":"Multimode control attacks on elections","authors":"Piotr Faliszewski, Edith Hemaspaandra, Lane A Hemaspaandra","year":"2011","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Hal, 2010] Alex halderman strengthens democracy using soft- ware, Popular Science, http://www.popsci.com/brilliant-10-alex- halderman-strengthens-democracy-using-software, 2010.","title":"Alex halderman strengthens democracy using software","authors":null,"year":null,"venue":null,"doi":null,"url":"http://www.popsci.com/brilliant-10-alex-halderman-strengthens-democracy-using-software,2010","internal_url":null},{"position":21,"raw":"[Letchford et al., 2009] Joshua Letchford, Vincent Conitzer, and Kamesh Munagala. Learning and approximating the optimal strategy to commit to. In Algorithmic Game Theory, Second In- ternational Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings, pages 250-262, 2009.","title":"Learning and approximating the optimal strategy to commit to","authors":"Joshua Letchford, Vincent Conitzer, Kamesh Munagala","year":"2009","venue":"Algorithmic Game Theory, Second International Symposium, SAGT 2009","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Liu and Zhu, 2010] Hong Liu and Daming Zhu. Parameterized complexity of control problems in maximin election. Inf. Pro- cess. Lett., 110(10):383-388, 2010.","title":"Parameterized complexity of control problems in maximin election","authors":"Zhu ; Liu, Hong Liu, Daming Zhu","year":"2010","venue":"Inf. Process. Lett","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Liu and Zhu, 2013] Hong Liu and Daming Zhu. Parameterized complexity of control by voter selection in maximin, copeland, borda, bucklin, and approval election systems. Theor. Comput. Sci., 498:115-123, 2013.","title":"Parameterized complexity of control by voter selection in maximin, copeland, borda, bucklin, and approval election systems","authors":"Zhu Liu, Hong Liu, Daming Zhu","year":"2013","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Mattei et al., 2014] Nicholas Mattei, Nina Narodytska, and Toby Walsh. How hard is it to control an election by breaking ties? In Torsten Schaub, Gerhard Friedrich, and Barry O'Sullivan, edi- tors, ECAI, volume 263 of Frontiers in Artificial Intelligence and Applications, pages 1067-1068. IOS Press, 2014. [","title":"How hard is it to control an election by breaking ties?","authors":"Nicholas Mattei, Nina Narodytska, Toby Walsh","year":"2014","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[RT, 2013] Election day bombings sweep pakistan: Over 30 killed, more than 200 injured. https://www.rt.com/news/ pakistan-election-day-bombing-136, 2013.","title":"Election day bombings sweep pakistan: Over 30 killed, more than 200 injured","authors":"Rt","year":"2013","venue":null,"doi":null,"url":"https://www.rt.com/news/pakistan-election-day-bombing-136,2013","internal_url":null},{"position":26,"raw":"[Wolchok et al., 2012] Scott Wolchok, Eric Wustrow, Dawn Isabel, and J. Alex Halderman. Attacking the washington, D.C. inter- net voting system. In Financial Cryptography and Data Se- curity -16th International Conference, FC 2012, Kralendijk, Bonaire, Februray 27-March 2, 2012, Revised Selected Papers, pages 114-128, 2012.","title":"Attacking the washington, D.C. internet voting system","authors":"Scott Wolchok, Eric Wustrow, Dawn Isabel, J Alex Halderman","year":"2012","venue":"Financial Cryptography and Data Security -16th International Conference","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Yin et al., 2016] Yue Yin, Yevgeniy Vorobeychik, Bo An, and Noam Hazon. Optimally protecting elections. In Proc. Twenty- Fifth International Joint Conference on Artificial Intelligence, IJ- CAI 2016, New York, NY, USA, 9-15 July 2016, pages 538-545, 2016.","title":"Optimally protecting elections","authors":"Yevgeniy Yue Yin, Bo Vorobeychik, Noam An, Hazon","year":"2016","venue":"Proc. Twenty-Fifth International Joint Conference on Artificial Intelligence, IJ-CAI 2016","doi":null,"url":null,"internal_url":"/proceedings/2016/83"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}