{"type":"ScholarlyArticle","title":"Sybil-Resilient Reality-Aware Social Choice","authors":[{"name":"Gal Shahaf","slug":"gal-shahaf","given":"Gal","family":"Shahaf","affiliation":"Weizmann Institute of Science"},{"name":"Ehud Shapiro","slug":"ehud-shapiro","given":"Ehud","family":"Shapiro","affiliation":"Weizmann Institute of Science"},{"name":"Nimrod Talmon","slug":"nimrod-talmon","given":"Nimrod","family":"Talmon","affiliation":"Ben-Gurion University"}],"abstract":"Sybil attacks, in which fake or duplicate identities (a.k.a., Sybils) infiltrate an online community, pose a serious threat to such communities, as they might tilt community-wide decisions in their favor. While the extensive research on sybil identification may help keep the fraction of sybils in such communities low, it cannot however ensure their complete eradication. Thus, our goal here is to enhance social choice theory with effective group decision mechanisms for communities with bounded sybil penetration. Inspired by Reality-Aware Social Choice, we use the status quo as the anchor of Sybil Resilience, characterized by Sybil Safety -- the inability of sybils to change the status quo against the will of the genuine agents, and Sybil Liveness -- the ability of the genuine agents to change the status quo against the will of the sybils. We consider the social choice settings of deciding on a single proposal, on multiple proposals, and on updating a parameter. For each, we present social choice rules that are sybil-safe and, under certain conditions, satisfy sybil-liveness.","doi":"10.24963/ijcai.2019/81","url":"https://ijcai.org/proceedings/2019/81","pdf":"https://ijcai.org/proceedings/2019/0081.pdf","markdown":"https://ijcai.org/proceedings/2019/81.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/81","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":81,"pages":{"first":572,"last":579},"keywords":["Agent-based and Multi-agent Systems: Voting","Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[],"references":[{"position":1,"raw":"[Alvisi et al., 2013] L. Alvisi, A. Clement, A. Epasto, S. Lat- tanzi, and A. Panconesi. SoK: The evolution of sybil de- fense via social networks. In Proceedings of SP '13, pages 382-396, 2013.","title":"SoK: The evolution of sybil defense via social networks","authors":"L Alvisi, A Clement, A Epasto, S Lattanzi, A Panconesi","year":"2013","venue":"Proceedings of SP '13","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Black, 1948] D. Black. On the rationale of group decision- making. Journal of political economy, 56(1):23-34, 1948.","title":"On the rationale of group decisionmaking","authors":"D Black","year":"1948","venue":"Journal of political economy","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bredereck et al., 2017] R. Bredereck, P. Faliszewski, A. Kaczmarczyk, R. Niedermeier, P. Skowron, and N. Talmon. Robustness among multiwinner voting rules. In Proceedings of SAGT '17, pages 80-92, 2017.","title":"Robustness among multiwinner voting rules","authors":"R Bredereck, P Faliszewski, A Kaczmarczyk, R Niedermeier, P Skowron, N Talmon","year":"2017","venue":"Proceedings of SAGT '17","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cao et al., 2012] Q. Cao, M. Sirivianos, X. Yang, and T. Pregueiro. Aiding the detection of fake accounts in large scale social online services. In Proceedings of NSDI '12, pages 15-15, 2012.","title":"Aiding the detection of fake accounts in large scale social online services","authors":"Q Cao, M Sirivianos, X Yang, T Pregueiro","year":"2012","venue":"Proceedings of NSDI '12","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chiang et al., 2013] J. T. Chiang, Y.-C. Hu, and P. Ya- dav. Secure cooperative spectrum sensing based on sybil- resilient clustering. In Proceedings of GLOBECOM '13, pages 1075-1081, 2013.","title":"Secure cooperative spectrum sensing based on sybilresilient clustering","authors":"J T Chiang, Y.-C Hu, P Yadav","year":"2013","venue":"Proceedings of GLOBECOM '13","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Conitzer and Yokoo, 2010] V. Conitzer and M. Yokoo. Us- ing mechanism design to prevent false-name manipula- tions. AI magazine, 31(4):65-78, 2010.","title":"Using mechanism design to prevent false-name manipulations","authors":"V Conitzer, M Yokoo","year":"2010","venue":"AI magazine","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Conitzer et al., 2010] V. Conitzer, N. Immorlica, J. Letch- ford, K. Munagala, and L. Wagman. False-name- proofness in social networks. In Proceedings of WINE '10, pages 209-221, 2010.","title":"False-nameproofness in social networks","authors":"V Conitzer, N Immorlica, J Letchford, K Munagala, L Wagman","year":"2010","venue":"Proceedings of WINE '10","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Conitzer, 2008] V. Conitzer. Anonymity-proof voting rules. In Proceedings of WINE '08, pages 295-306, 2008.","title":"Anonymity-proof voting rules","authors":"V Conitzer","year":"2008","venue":"Proceedings of WINE '08","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Douceur, 2002] J. R. Douceur. The sybil attack. In Proceed- ings of IPTPS '02, pages 251-260, 2002.","title":"The sybil attack","authors":"J R Douceur","year":"2002","venue":"Proceedings of IPTPS '02","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Faliszewski and Rothe, 2016] P. Faliszewski and J. Rothe. Control and bribery in voting. In H. Moulin, F. Brandt, V. Conitzer, U. Endriss, A. D. Procaccia, and J. Lang, ed- itors, Handbook of Computational Social Choice. Cam- bridge University Press, 2016.","title":"Control and bribery in voting","authors":"P Faliszewski, J Rothe","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Faliszewski et al., 2017] P. Faliszewski, P. Skowron, and N. Talmon. Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules. In Proceedings of AAMAS '17, pages 6-14, 2017.","title":"Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules","authors":"P Faliszewski, P Skowron, N Talmon","year":"2017","venue":"Proceedings of AAMAS '17","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gehrlein, 1985] W. V. Gehrlein. The Condorcet criterion and committee selection. Mathematical Social Sciences, 10(3):199-209, 1985.","title":"The Condorcet criterion and committee selection","authors":"W V Gehrlein","year":"1985","venue":"Mathematical Social Sciences","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Lalley and Weyl, 2018] S. P. Lalley and E. G. Weyl. Quadratic voting: How mechanism design can radicalize democracy. In AEA, volume 108, pages 33-37, 2018.","title":"Quadratic voting: How mechanism design can radicalize democracy","authors":"S P Lalley, E G Weyl","year":"2018","venue":"AEA","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"K. O. May. A set of independent necessary and sufficient conditions for simple majority decision. Econo- metrica, pages 680-684, 1952.","title":"A set of independent necessary and sufficient conditions for simple majority decision","authors":"K O May","year":"1952","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[McLean, 1990] Iain McLean. The Borda and Condorcet principles: three medieval applications. Social Choice and Welfare, 7(2):99-108, 1990.","title":"The Borda and Condorcet principles: three medieval applications","authors":"Iain Mclean","year":"1990","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Molavi Kakhki et al., 2013] A. Molavi Kakhki, C. Kliman- Silver, and A. Mislove. Iolaus: Securing online content rating systems. In Proceedings of WWW '13, pages 919- 930, 2013.","title":"Iolaus: Securing online content rating systems","authors":"A Molavi Kakhki, C Kliman-Silver, A Mislove","year":"2013","venue":"Proceedings of WWW '13","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Poupko et al., 2019] O. Poupko, G. Shahaf, E. Shapiro, and N. Talmon. Sybil-resilient conductance-based community expansion. In Proceedings of CSR '19, 2019. To appear.","title":"Sybil-resilient conductance-based community expansion","authors":"O Poupko, G Shahaf, E Shapiro, N Talmon","year":"2019","venue":"Proceedings of CSR '19","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Shapiro and Talmon, 2018] E. Shapiro and N. Talmon. In- corporating reality into social choice. In Proceedings of AAMAS '18, pages 1188-1192, 2018.","title":"Incorporating reality into social choice","authors":"E Shapiro, N Talmon","year":"2018","venue":"Proceedings of AAMAS '18","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Tran et al., 2009] D. N. Tran, B. Min, J. Li, and L. Subrama- nian. Sybil-resilient online content voting. In Proceedings of NSDI '09, pages 15-28, 2009.","title":"Sybil-resilient online content voting","authors":"D N Tran, B Min, J Li, L Subramanian","year":"2009","venue":"Proceedings of NSDI '09","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Viswanath et al., 2010] B. Viswanath, A. Post, K. P. Gum- madi, and A. Mislove. An analysis of social network-based sybil defenses. ACM SIGCOMM Computer Communica- tion Review, 40(4):363-374, 2010.","title":"An analysis of social network-based sybil defenses","authors":"B Viswanath, A Post, K P Gummadi, A Mislove","year":"2010","venue":"ACM SIGCOMM Computer Communication Review","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Waggoner et al., 2012] B. Waggoner, L. Xia, and V. Conitzer. Evaluating resistance to false-name ma- nipulations in elections. In Proceedings of AAAI '12, pages 1485-1491, 2012.","title":"Evaluating resistance to false-name manipulations in elections","authors":"B Waggoner, L Xia, V Conitzer","year":"2012","venue":"Proceedings of AAAI '12","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Wagman and Conitzer, 2008] L. Wagman and V. Conitzer. Optimal false-name-proof voting rules with costly voting. In Proceedings of AAAI '08, pages 190-195, 2008.","title":"Optimal false-name-proof voting rules with costly voting","authors":"L Wagman, V Conitzer","year":"2008","venue":"Proceedings of AAAI '08","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Wagman and Conitzer, 2014] L. Wagman and V. Conitzer. False-name-proof voting with costs over two alternatives. International Journal of Game Theory, 43(3):599-618, 2014.","title":"False-name-proof voting with costs over two alternatives","authors":"L Wagman, V Conitzer","year":"2014","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}