{"type":"ScholarlyArticle","title":"Local Differential Privacy Meets Computational Social Choice - Resilience under Voter Deletion","authors":[{"name":"Liangde Tao","slug":"liangde-tao","given":"Liangde","family":"Tao","affiliation":"Zhejiang University"},{"name":"Lin Chen","slug":"lin-chen","given":"Lin","family":"Chen","affiliation":"Texas Tech University"},{"name":"Lei Xu","slug":"lei-xu","given":"Lei","family":"Xu","affiliation":"Kent State University"},{"name":"Weidong Shi","slug":"weidong-shi","given":"Weidong","family":"Shi","affiliation":"University of Houston"}],"abstract":"The resilience of a voting system has been a central topic in computational social choice. Many voting rules, like plurality, are shown to be vulnerable as the attacker can target specific voters to manipulate the result. What if a local differential privacy (LDP) mechanism is adopted such that the true preference of a voter is never revealed in pre-election polls? In this case, the attacker can only infer stochastic information about a voter's true preference, and this may cause the manipulation of the electoral result significantly harder. The goal of this paper is to provide a quantitative study on the effect of adopting LDP mechanisms on a voting system. We introduce the metric PoLDP (power of LDP) that quantitatively measures the difference between the attacker's manipulation cost under LDP mechanisms and that without LDP mechanisms. The larger PoLDP is, the more robustness LDP mechanisms can add to a voting system. We give a full characterization of PoLDP for the voting system with plurality rule and provide general guidance towards the application of LDP mechanisms.","doi":"10.24963/ijcai.2022/547","url":"https://ijcai.org/proceedings/2022/547","pdf":"https://ijcai.org/proceedings/2022/0547.pdf","markdown":"https://ijcai.org/proceedings/2022/547.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/547","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Multidisciplinary Topics and Applications","track":"Main Track","number":547,"pages":{"first":3940,"last":3946},"keywords":["Agent-based and Multi-agent Systems: Computational Social Choice","Multidisciplinary Topics and Applications: Security and Privacy"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986527","length_sec":83,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984670","length_sec":328,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Azari et al., 2012] Hossein Azari, David Parks, and Lirong Xia. Random utility theory for social choice. Advances in Neural Information Processing Systems, 25:126-134, 2012.","title":"Random utility theory for social choice","authors":"Hossein Azari, David Parks, Lirong Xia","year":"2012","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bartholdi III et al., 1992] John J Bartholdi III, Craig A Tovey, and Michael A Trick. How hard is it to control an election? Mathematical and Computer Modelling, 16(8- 9):27-40, 1992.","title":"How hard is it to control an election?","authors":"John J Bartholdi, Iii, Craig A Tovey, Michael A Trick","year":"1992","venue":"Mathematical and Computer Modelling","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bebensee, 2019] Björn Bebensee. Local differential pri- vacy: a tutorial. arXiv preprint arXiv:1907.11908, 2019.","title":"Local differential privacy: a tutorial","authors":"Björn Bebensee, Bebensee","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Brandt et al., 2016] Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D Procaccia. Handbook of computational social choice. Cambridge University Press, 2016.","title":"Handbook of computational social choice","authors":"Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D Procaccia","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bun et al., 2019] Mark Bun, Jelani Nelson, and Uri Stem- mer. Heavy hitters and the structure of local privacy. ACM Transactions on Algorithms, 15(4):1-40, 2019.","title":"Stemmer. Heavy hitters and the structure of local privacy","authors":"Mark Bun, Jelani Nelson, Uri","year":"2019","venue":"ACM Transactions on Algorithms","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chen et al., 2018] Lin Chen, Lei Xu, Shouhuai Xu, Zhimin Gao, Nolan Shah, Yang Lu, and Weidong Shi. Protecting election from bribery: New approach and computational complexity characterization. In Proceedings of the 17th International Conference on Autonomous Agents and Mul- tiagent Systems, pages 1894-1896, 2018.","title":"Protecting election from bribery: New approach and computational complexity characterization","authors":"Lin Chen, Lei Xu, Shouhuai Xu, Zhimin Gao, Nolan Shah, Yang Lu, Weidong Shi","year":"2018","venue":"Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cheu et al., 2021] Albert Cheu, Adam Smith, and Jonathan Ullman. Manipulation attacks in local differential privacy. In Proceedings of the 42nd IEEE Symposium on Security and Privacy, pages 883-900, 2021.","title":"Manipulation attacks in local differential privacy","authors":"Cheu","year":"2021","venue":"Proceedings of the 42nd IEEE Symposium on Security and Privacy","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Conitzer et al., 2011] Vincent Conitzer, Toby Walsh, and Lirong Xia. Dominating manipulations in voting with par- tial information. In Proceedings of the 25th AAAI Confer- ence on Artificial Intelligence, 2011.","title":"Dominating manipulations in voting with partial information","authors":"Vincent Conitzer, Toby Walsh, Lirong Xia","year":"2011","venue":"Proceedings of the 25th AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dey et al., 2018] Palash Dey, Neeldhara Misra, and Yadati Narahari. Complexity of manipulation with partial infor- mation in voting. Theoretical Computer Science, 726:78- 99, 2018.","title":"Complexity of manipulation with partial information in voting","authors":"Palash Dey, Neeldhara Misra, Yadati Narahari","year":"2018","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Erlingsson et al., 2014] Úlfar Erlingsson, Vasyl Pihur, and Aleksandra Korolova. Rappor: Randomized aggregatable privacy-preserving ordinal response. In Proceedings of the 21st ACM SIGSAC Conference on Computer and Commu- nications Security, pages 1054-1067, 2014.","title":"Aleksandra Korolova. Rappor: Randomized aggregatable privacy-preserving ordinal response","authors":"Erlingsson","year":"2014","venue":"Proceedings of the 21st ACM SIGSAC Conference on Computer and Communications Security","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Faliszewski et al., 2009] Piotr Faliszewski, Edith Hemas- paandra, and Lane A Hemaspaandra. How hard is bribery in elections? Journal of artificial Intelligence Research, 35:485-532, 2009.","title":"How hard is bribery in elections","authors":"Piotr Faliszewski, Edith Hemaspaandra, Lane A Hemaspaandra","year":"2009","venue":"Journal of artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hemaspaandra et al., 2007] Edith Hemaspaandra, Lane A Hemaspaandra, and Jörg Rothe. Anyone but him: The complexity of precluding an alternative. Artificial Intelli- gence, 171(5-6):255-285, 2007.","title":"Anyone but him: The complexity of precluding an alternative","authors":"Hemaspaandra","year":"2007","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hemaspaandra et al., 2017] Edith Hemaspaandra, Lane A Hemaspaandra, and Jörg Rothe. The complexity of con- trolling candidate-sequential elections. Theoretical Com- puter Science, 678:14-21, 2017.","title":"The complexity of controlling candidate-sequential elections","authors":"Hemaspaandra","year":"2017","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kamishima, 2003] Toshihiro Kamishima. Nantonac col- laborative filtering: recommendation based on order re- sponses. In Proceedings of the 9th ACM SIGKDD Inter- national Conference on Knowledge Discovery and Data mining, pages 583-588, 2003.","title":"Nantonac collaborative filtering: recommendation based on order responses","authors":"Toshihiro Kamishima","year":"2003","venue":"Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data mining","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kasiviswanathan et al., 2011] Shiva Prasad Ka- siviswanathan, Homin K Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. What can we learn privately? SIAM Journal on Computing, 40(3):793-826, 2011.","title":"What can we learn privately?","authors":"Shiva Prasad Kasiviswanathan, K Homin, Kobbi Lee, Sofya Nissim, Adam Raskhodnikova, Smith","year":"2011","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kenny, 1986] David A Kenny. Statistics for the social and behavioral sciences. Little, Brown, 1986.","title":"Statistics for the social and behavioral sciences","authors":"A David, Kenny","year":"1986","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Koutsoupias and Papadimitriou, 1999] Elias Koutsoupias and Christos Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 404-413, 1999.","title":"Elias Koutsoupias and Christos Papadimitriou. Worst-case equilibria","authors":"Papadimitriou Koutsoupias","year":"1999","venue":"Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Magiera and Faliszewski, 2017] Krzysztof Magiera and Pi- otr Faliszewski. How hard is control in single-crossing elections? Autonomous Agents and Multi-Agent Systems, 31(3):606-627, 2017.","title":"How hard is control in single-crossing elections?","authors":"Krzysztof Magiera, Piotr Faliszewski","year":"2017","venue":"Autonomous Agents and Multi-Agent Systems","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Maushagen and Rothe, 2016] Cynthia Maushagen and Jörg Rothe. Complexity of control by partitioning veto and maximin elections and of control by adding candidates to plurality elections. In Proceedings of the 22nd Euro- pean Conference on Artificial Intelligence, pages 277-285, 2016.","title":"Complexity of control by partitioning veto and maximin elections and of control by adding candidates to plurality elections","authors":"Rothe Maushagen, Cynthia Maushagen, Jörg Rothe","year":"2016","venue":"Proceedings of the 22nd European Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Qin et al., 2016] Zhan Qin, Yin Yang, Ting Yu, Issa Khalil, Xiaokui Xiao, and Kui Ren. Heavy hitter estimation over set-valued data with local differential privacy. In Proceed- ings of the 23rd ACM SIGSAC Conference on Computer and Communications Security, pages 192-203, 2016.","title":"Heavy hitter estimation over set-valued data with local differential privacy","authors":"Zhan Qin, Yin Yang, Ting Yu, Issa Khalil, Xiaokui Xiao, Kui Ren","year":"2016","venue":"Proceedings of the 23rd ACM SIGSAC Conference on Computer and Communications Security","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Rey and Rothe, 2016] Anja Rey and Jörg Rothe. Structural control in weighted voting games. In Proceedings of the 15th International Conference on Autonomous Agents & Multiagent Systems, pages 1371-1372, 2016.","title":"Structural control in weighted voting games","authors":"Rey, Rothe, Anja Rey, Jörg Rothe","year":"2016","venue":"Proceedings of the 15th International Conference on Autonomous Agents & Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Rosenfeld et al., 2016] Bryn Rosenfeld, Kosuke Imai, and Jacob N Shapiro. An empirical validation study of popular survey methodologies for sensitive questions. American Journal of Political Science, 60(3):783-802, 2016.","title":"An empirical validation study of popular survey methodologies for sensitive questions","authors":"Rosenfeld","year":"2016","venue":"American Journal of Political Science","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Wang and Blocki, 2017] Tianhao Wang and Jeremiah Blocki. Locally differentially private protocols for fre- quency estimation. In Proceedings of the 26th USENIX Security Symposium, pages 729-745, 2017.","title":"Locally differentially private protocols for frequency estimation","authors":"Wang, Blocki ;, Tianhao Wang, Jeremiah Blocki","year":"2017","venue":"Proceedings of the 26th USENIX Security Symposium","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Wang et al., 2016] Yue Wang, Xintao Wu, and Donghui Hu. Using randomized response for differential privacy pre- serving data collection. In EDBT/ICDT Workshops, vol- ume 1558, pages 0090-6778, 2016.","title":"Using randomized response for differential privacy preserving data collection","authors":"Yue Wang, Xintao Wu, Donghui Hu","year":"2016","venue":"EDBT/ICDT Workshops","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Yin et al., 2018] Yue Yin, Yevgeniy Vorobeychik, Bo An, and Noam Hazon. Optimal defense against election con- trol by deleting voter groups. Artificial Intelligence, 259:32-51, 2018.","title":"Optimal defense against election control by deleting voter groups","authors":"Yevgeniy Yue Yin, Bo Vorobeychik, Noam An, Hazon","year":"2018","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}