Manipulating Opinion Diffusion in Social Networks

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.

[1]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[2]  YildizErcan,et al.  Binary Opinion Dynamics with Stubborn Agents , 2013 .

[3]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[4]  Eric Goles Ch.,et al.  Periodic behaviour of generalized threshold functions , 1980, Discret. Math..

[5]  Rolf Niedermeier,et al.  Constant Thresholds Can Make Target Set Selection Tractable , 2012, Theory of Computing Systems.

[6]  G. Winskel.  What Is Discrete Mathematics , 2007 .

[7]  Rolf Niedermeier,et al.  On tractable cases of Target Set Selection , 2010, Social Network Analysis and Mining.

[8]  Ioannis Caragiannis,et al.  Minority Becomes Majority in Social Networks , 2014, WINE.

[9]  Michael K. Ng,et al.  On the Complexity of Finding Control Strategies for Boolean Networks , 2005, APBC.

[10]  Jon M. Kleinberg,et al.  On discrete preferences and coordination , 2018, J. Comput. Syst. Sci..

[11]  Piotr Faliszewski,et al.  Multimode Control Attacks on Elections , 2009, IJCAI.

[12]  Piotr Faliszewski,et al.  AI's War on Manipulation: Are We Winning? , 2010, AI Mag..

[13]  Roger Wattenhofer,et al.  Convergence in (Social) Influence Networks , 2013, DISC.

[14]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[15]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[16]  Ilan Newman,et al.  Treewidth governs the complexity of target set selection , 2011, Discret. Optim..

[17]  Jon M. Kleinberg,et al.  On discrete preferences and coordination , 2013, EC '13.

[18]  Umberto Grandi,et al.  Social Choice and Social Networks , 2017 .

[19]  ConitzerVincent,et al.  The ACM transactions on economics and computation , 2013 .

[20]  G. Ding.  Discrete optimization , 1977 .

[21]  Ning Chen,et al.  On the approximability of influence in social networks , 2008, SODA '08.

[22]  Howard Straubing,et al.  Theory of Computing Systems , 2008 .

[23]  VoLUME Xxxix,et al.  THE AMERICAN JOURNAL OF SOCIOLOGY , 2010 .

[24]  P. Faliszewski,et al.  Control and Bribery in Voting , 2016, Handbook of Computational Social Choice.