{"type":"ScholarlyArticle","title":"Manipulating Opinion Diffusion in Social Networks","authors":[{"name":"Robert Bredereck","slug":"robert-bredereck","given":"Robert","family":"Bredereck","affiliation":"University of Oxford Oxford , United Kingdom ,; TU Berlin , Germany"},{"name":"Edith Elkind","slug":"edith-elkind","given":"Edith","family":"Elkind","affiliation":"University of Oxford Oxford , United Kingdom"}],"abstract":"We consider opinion diffusion in binary influence networks, where at each step one or more agents update their opinions so as to be in agreement with the majority of their neighbors. We consider several ways of manipulating the majority opinion in a stable outcome, such as bribing agents, adding/deleting links, and changing the order of updates, and investigate the computational complexity of the associated problems, identifying tractable and intractable cases.","doi":"10.24963/ijcai.2017/124","url":"https://ijcai.org/proceedings/2017/124","pdf":"https://ijcai.org/proceedings/2017/0124.pdf","markdown":"https://ijcai.org/proceedings/2017/124.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/124","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":124,"pages":{"first":894,"last":900},"keywords":["Knowledge Representation, Reasoning, and Logic: Game Theory","Agent-based and Multi-agent Systems: Social Choice Theory"],"videos":[],"references":[{"position":1,"raw":"[Akutsu et al., 2006] Tatsuya Akutsu, Morihiro Hayashida, Wai-Ki Ching, and Michael K. Ng. On the complexity of finding control strategies for Boolean networks. In Pro- ceedings of the 4th Asia-Pacific Bioinformatics Confer- ence (APBC'06), pages 99-108. Imperial College Press, 2006.","title":"On the complexity of finding control strategies for Boolean networks","authors":"Tatsuya Akutsu, Morihiro Hayashida, Wai-Ki Ching, Michael K Ng","year":"2006","venue":"Proceedings of the 4th Asia-Pacific Bioinformatics Conference (APBC'06)","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Auletta et al., 2015] Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, and Giuseppe Per- siano. Minority becomes majority in social networks. In Proceedings of the 11th International Conference on Web and Internet Economics (WINE'15), pages 74-88. Springer, 2015.","title":"Minority becomes majority in social networks","authors":"Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe","year":"2015","venue":"Proceedings of the 11th International Conference on Web and Internet Economics (WINE'15)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Ben-Zwi et al., 2011] Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, and Ilan Newman. Treewidth governs the complexity of target set selection. Discrete Optimiza- tion, 8(1):87-96, 2011.","title":"Treewidth governs the complexity of target set selection","authors":"Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman","year":"2011","venue":"Discrete Optimization","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chen, 2009] Ning Chen. On the approximability of influ- ence in social networks. SIAM Journal on Discrete Math- ematics, 23(3):1400-1415, 2009.","title":"On the approximability of influence in social networks","authors":"Ning Chen","year":"2009","venue":"SIAM Journal on Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chierichetti et al., 2013] Flavio Chierichetti, Jon M. Klein- berg, and Sigal Oren. On discrete preferences and co- ordination. In Proceedings of the 14th ACM Conference on Electronic Commerce (EC'13), pages 233-250. ACM, 2013.","title":"On discrete preferences and coordination","authors":"Flavio Chierichetti, Jon M Kleinberg, Sigal Oren","year":"2013","venue":"Proceedings of the 14th ACM Conference on Electronic Commerce (EC'13)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chopin et al., 2014] Morgan Chopin, André Nichterlein, Rolf Niedermeier, and Mathias Weller. Constant thresh- olds can make target set selection tractable. Theory of Computing Systems, 55(1):61-83, 2014.","title":"Constant thresholds can make target set selection tractable","authors":"Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller","year":"2014","venue":"Theory of Computing Systems","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Faliszewski and Procaccia, 2010] Piotr Faliszewski and Ariel Procaccia. AI's war on manipulation: Are we winning? AI Magazine, 31(4):52-64, 2010.","title":"Piotr Faliszewski and Ariel Procaccia. AI's war on manipulation: Are we winning?","authors":"Procaccia Faliszewski","year":"2010","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Faliszewski and Rothe, 2015] Piotr Faliszewski and Jörg Rothe. Control and bribery in voting. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. D. Procaccia, editors, Handbook of Computational Social Choice. Cam- bridge University Press, 2015.","title":"Control and bribery in voting","authors":"Piotr Faliszewski, Jörg Rothe","year":"2015","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Faliszewski et al., 2011] Piotr Faliszewski, Edith Hemas- paandra, and Lane Hemaspaandra. Multimode control at- tacks on elections. Journal of AI Research, 40:305-351, 2011.","title":"Multimode control attacks on elections","authors":"Piotr Faliszewski, Edith Hemaspaandra, Lane Hemaspaandra","year":"2011","venue":"Journal of AI Research","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Frischknecht et al., 2013] Silvio Frischknecht, Barbara Keller, and Roger Wattenhofer. Convergence in (social) influence networks. In Proceedings of the 27th Interna- tional Symposium on Distributed Computing (DISC'13), volume 8205 of LNCS, pages 433-446. Springer, 2013.","title":"Convergence in (social) influence networks","authors":"Silvio Frischknecht, Barbara Keller, Roger Wattenhofer","year":"2013","venue":"Proceedings of the 27th International Symposium on Distributed Computing (DISC'13)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Goles and Olivos, 1980] Eric Goles and Jorge Olivos. Pe- riodic behaviour of generalized threshold functions. Dis- crete Mathematics, 30(2):187-189, 1980.","title":"Periodic behaviour of generalized threshold functions","authors":"Olivos Goles, Eric Goles, Jorge Olivos","year":"1980","venue":"Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Grandi, 2017] Umberto Grandi. Social choice and social networks. In U. Endriss, editor, Trends in Computational Social Choice. AI Access, 2017.","title":"Social choice and social networks","authors":"Umberto Grandi","year":"2017","venue":"Trends in Computational Social Choice. AI Access","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Granovetter, 1973] Mark S. Granovetter. The strength of weak ties. American Journal of Sociology, 78(6):1360- 1380, 1973.","title":"The strength of weak ties","authors":"Mark S Granovetter","year":"1973","venue":"American Journal of Sociology","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Kellerer et al., 2004] Hans Kellerer, Ulrich Pferschy, and David Pisinger. Knapsack problems. Springer, 2004.","title":"Knapsack problems","authors":"Kellerer","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kempe et al., 2005] David Kempe, Jon M. Kleinberg, and Éva Tardos. Influential nodes in a diffusion model for social networks. In Proceedings of 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), pages 1127-1138, 2005.","title":"Influential nodes in a diffusion model for social networks","authors":"David Kempe, Jon M Kleinberg, Éva Tardos","year":"2005","venue":"Proceedings of 32nd International Colloquium on Automata, Languages and Programming (ICALP'05)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Nichterlein et al., 2013] André Nichterlein, Rolf Nieder- meier, Johannes Uhlmann, and Mathias Weller. On tractable cases of target set selection. Social Network Analysis and Mining, 3(2):233-256, 2013.","title":"On tractable cases of target set selection","authors":"Nichterlein","year":"2013","venue":"Social Network Analysis and Mining","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Robertson and Seymour, 1986] Neil Robertson and Paul D. Seymour. Graph minors. II. algorithmic aspects of tree- width. Journal of Algorithms, 7(3):309-322, 1986.","title":"Graph minors. II. algorithmic aspects of treewidth","authors":"Neil Robertson, Paul D Seymour","year":"1986","venue":"Journal of Algorithms","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Silva, 2017] Alonso Silva. Opinion Manipulation in Social Networks, pages 187-198. Springer, 2017.","title":"Opinion Manipulation in Social Networks","authors":"Alonso Silva","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Yildiz et al., 2013] Ercan Yildiz, Asuman Ozdaglar, Daron Acemoglu, Amin Saberi, and Anna Scaglione. Binary opinion dynamics with stubborn agents. ACM Transac- tions on Economics and Computation, 1(4):19:1-19:30, 2013.","title":"Binary opinion dynamics with stubborn agents","authors":"Ercan Yildiz, Asuman Ozdaglar, Daron Acemoglu, Amin Saberi, Anna Scaglione","year":"2013","venue":"ACM Transactions on Economics and Computation","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}