{"type":"ScholarlyArticle","title":"Opinion Diffusion and Campaigning on Society Graphs","authors":[{"name":"Piotr Faliszewski","slug":"piotr-faliszewski","given":"Piotr","family":"Faliszewski","affiliation":"AGH University of Science and Technology , Krakow , Poland"},{"name":"Rica Gonen","slug":"rica-gonen","given":"Rica","family":"Gonen","affiliation":"The Open University of Israel"},{"name":"Martin Koutecký","slug":"martin-koutecky","given":"Martin","family":"Koutecký","affiliation":"Technion -Israel Institute of Technology , Haifa , Israel; Charles University , Prague , Czech Republic"},{"name":"Nimrod Talmon","slug":"nimrod-talmon","given":"Nimrod","family":"Talmon","affiliation":"Ben-Gurion University , Be'er Sheva , Israel"}],"abstract":"We study the effects of campaigning, where the society is partitioned into voter clusters and a diffusion process propagates opinions in a network connecting those clusters. Our model is very general and can incorporate many campaigning actions, various partitions of the society into voter clusters, and very general diffusion processes. Perhaps surprisingly, we show that computing the cheapest campaign for rigging a given election can usually be done efficiently, even with arbitrarily-many voters.","doi":"10.24963/ijcai.2018/30","url":"https://ijcai.org/proceedings/2018/30","pdf":"https://ijcai.org/proceedings/2018/0030.pdf","markdown":"https://ijcai.org/proceedings/2018/30.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/30","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":30,"pages":{"first":219,"last":225},"keywords":["Constraints and SAT: Modeling;Formulation","Agent-based and Multi-agent Systems: Computational Social Choice","Agent-based and Multi-agent Systems: Voting"],"videos":[],"references":[{"position":1,"raw":"[Allcott and Gentzkow, 2017] H. Allcott and M. Gentzkow. Social media and fake news in the 2016 election. Journal of Economic Perspectives, 31(2):211-236, 2017.","title":"Social media and fake news in the 2016 election","authors":"H Allcott, M Gentzkow","year":"2017","venue":"Journal of Economic Perspectives","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Auletta et al., 2015] V. Auletta, I. Caragiannis, D. Ferraioli, C. Galdi, and G. Persiano. Minority becomes majority in social networks. In Proceedings of WINE '15, pages 74- 88, 2015.","title":"Minority becomes majority in social networks","authors":"V Auletta, I Caragiannis, D Ferraioli, C Galdi, G Persiano","year":"2015","venue":"Proceedings of WINE '15","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bisschop, 2006] J. Bisschop. AIMMS Optimization Model- ing. Paragon Decision Technology BV, 2006.","title":"AIMMS Optimization Modeling","authors":"J Bisschop","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Botan et al., 2017] S. Botan, U. Grandi, and L. Perrussel. Propositionwise opinion diffusion with constraints. In Proceedings of EXPLORE workshop, AAMAS '17, 2017.","title":"Propositionwise opinion diffusion with constraints","authors":"S Botan, U Grandi, L Perrussel","year":"2017","venue":"Proceedings of EXPLORE workshop, AAMAS '17","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bredereck and Elkind, 2017] R. Bredereck and E. Elkind. Manipulating opinion diffusion in social networks. In Pro- ceedings of IJCAI '17, 2017.","title":"Manipulating opinion diffusion in social networks","authors":"R Bredereck, E Elkind","year":"2017","venue":"Proceedings of IJCAI '17","doi":null,"url":null,"internal_url":"/proceedings/2017/124"},{"position":6,"raw":"[Bredereck et al., 2016a] R. Bredereck, J. Chen, P. Fal- iszewski, A. Nichterlein, and R. Niedermeier. Prices mat- ter for the parameterized complexity of shift bribery. In- formation and Computation, 251:140-164, 2016.","title":"Prices matter for the parameterized complexity of shift bribery","authors":"Bredereck","year":"2016","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bredereck et al., 2016b] R. Bredereck, P. Faliszewski, R. Niedermeier, and N. Talmon. Complexity of shift bribery in committee elections. In Proceedings of AAAI '16, pages 2452-2458, 2016.","title":"Complexity of shift bribery in committee elections","authors":"Bredereck","year":"2016","venue":"Proceedings of AAAI '16","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Brill et al., 2016] M. Brill, E. Elkind, U. Endriss, and U. Grandi. Pairwise diffusion of preference rankings in social networks. In Proceedings of IJCAI '16, pages 130- 136, 2016.","title":"Pairwise diffusion of preference rankings in social networks","authors":"M Brill, E Elkind, U Endriss, U Grandi","year":"2016","venue":"Proceedings of IJCAI '16","doi":null,"url":null,"internal_url":"/proceedings/2016/26"},{"position":9,"raw":"[Chen et al., 2009] W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In Proceedings of KDD '09, pages 199-208, 2009.","title":"Efficient influence maximization in social networks","authors":"W Chen, Y Wang, S Yang","year":"2009","venue":"Proceedings of KDD '09","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Christoff and Grossi, 2017] Z. Christoff and D. Grossi. Sta- bility in binary opinion diffusion. In Proceedings of LORI '17, pages 166-180, 2017.","title":"Stability in binary opinion diffusion","authors":"Z Christoff, D Grossi","year":"2017","venue":"Proceedings of LORI '17","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dorn and Schlotter, 2012] B. Dorn and I. Schlotter. Multi- variate complexity analysis of swap bribery. Algorithmica, 64(1):126-151, 2012.","title":"Multivariate complexity analysis of swap bribery","authors":"B Dorn, I Schlotter","year":"2012","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Elkind and Faliszewski, 2010] E. Elkind and P. Faliszewski. Approximation algorithms for campaign management. In Proceedings of WINE '10, pages 473-482, 2010.","title":"Approximation algorithms for campaign management","authors":"E Elkind, P Faliszewski","year":"2010","venue":"Proceedings of WINE '10","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Elkind et al., 2009] E. Elkind, P. Faliszewski, and A. Slinko. Swap bribery. In Proceedings of SAGT '09, pages 299-310, 2009.","title":"Swap bribery","authors":"E Elkind, P Faliszewski, A Slinko","year":"2009","venue":"Proceedings of SAGT '09","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Faliszewski and Rothe, 2015] P. Faliszewski and J. Rothe. Control and bribery in voting. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, editors, Hand- book of Computational Social Choice, chapter 7. Cam- bridge University Press, 2015.","title":"Control and bribery in voting","authors":"P Faliszewski, J Rothe","year":"2015","venue":"Handbook of Computational Social Choice, chapter 7","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Faliszewski et al., 2009] P. Faliszewski, E. Hemaspaandra, and L. Hemaspaandra. How hard is bribery in elections? Journal of Artificial Intelligence Research, 35:485-532, 2009.","title":"How hard is bribery in elections","authors":"P Faliszewski, E Hemaspaandra, L Hemaspaandra","year":"2009","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Faliszewski et al., 2011] P. Faliszewski, E. Hemaspaandra, and L. A. Hemaspaandra. Multimode control attacks on elections. Journal of Artificial Intelligence Research, 40:305-351, 2011.","title":"Multimode control attacks on elections","authors":"P Faliszewski, E Hemaspaandra, L A Hemaspaandra","year":"2011","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":17,"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":18,"raw":"[Garey and Johnson, 1979] M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.","title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","authors":"M R Garey, D S Johnson","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Grandi, 2017] U. Grandi. Social choice and social net- works. In U. Endriss, editor, Trends in Computational So- cial Choice. 2017.","title":"Social choice and social networks","authors":"U Grandi","year":"2017","venue":"Trends in Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Izsak et al., 2018] R. Izsak, N. Talmon, and G. J. Woegin- ger. Committee selection with intraclass and interclass synergies. In Proceedings of AAAI '18, 2018.","title":"Committee selection with intraclass and interclass synergies","authors":"R Izsak, N Talmon, G J Woeginger","year":"2018","venue":"Proceedings of AAAI '18","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Kempe et al., 2003] D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social net- work. In Proceedings of KDD '03, pages 137-146, 2003.","title":"Maximizing the spread of influence through a social network","authors":"D Kempe, J Kleinberg, É Tardos","year":"2003","venue":"Proceedings of KDD '03","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Knop et al., 2018] D. Knop, M. Koutecký, and M. Mnich. A unifying framework for manipulation problems. arXiv preprint arXiv:1801.09584, 2018.","title":"A unifying framework for manipulation problems","authors":"D Knop, M Koutecký, M Mnich","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lenstra Jr, 1983] H. Lenstra Jr. Integer programming with a fixed number of variables. Mathematics of operations research, 8(4):538-548, 1983.","title":"Integer programming with a fixed number of variables","authors":"H Lenstra","year":"1983","venue":"Mathematics of operations research","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Procaccia et al., 2015] A. D. Procaccia, N. Shah, and E. Sodomka. Ranked voting on social networks. In Proocedings of IJCAI '15, pages 2040-2046, 2015.","title":"Ranked voting on social networks","authors":"A D Procaccia, N Shah, E Sodomka","year":"2015","venue":"Proocedings of IJCAI '15","doi":null,"url":null,"internal_url":"/proceedings/2015/289"},{"position":25,"raw":"[Shakarian et al., 2015] P. Shakarian, A. Bhatnagar, A. Aleali, E. Shaabani, and R. Guo. Diffusion in social networks. Springer, 2015.","title":"Diffusion in social networks","authors":"P Shakarian, A Bhatnagar, A Aleali, E Shaabani, R Guo","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Silva, 2016] A. Silva. Opinion manipulation in social net- works. In Proceedings of NETGCOOP '16, pages 187- 198, 2016.","title":"Opinion manipulation in social networks","authors":"A Silva","year":"2016","venue":"Proceedings of NETGCOOP '16","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Sina et al., 2015] S. Sina, N. Hazon, A. Hassidim, and S. Kraus. Adapting the social network to affect elections. In Proceedings of AAMAS '15, pages 705-713, 2015.","title":"Adapting the social network to affect elections","authors":"S Sina, N Hazon, A Hassidim, S Kraus","year":"2015","venue":"Proceedings of AAMAS '15","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Talmon, 2017] N. Talmon. Structured proportional repre- sentation. In Proceedings of AAMAS '17, pages 633-641, 2017.","title":"Structured proportional representation","authors":"N Talmon","year":"2017","venue":"Proceedings of AAMAS '17","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Wilder and Vorobeychik, 2017] B. Wilder and Y. Vorobey- chik. Controlling elections through social influence. arXiv preprint arXiv:1711.08615, 2017.","title":"Controlling elections through social influence","authors":"B Wilder, Y Vorobeychik","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}