Optimizing Opinions with Stubborn Agents
D. Scott Hunter, Tauhid Zaman

TL;DR
This paper develops a method to optimally place stubborn agents in social networks to influence opinions, using submodular optimization and real Twitter data, while also analyzing a noisy opinion dynamics model.
Contribution
It introduces a discrete optimization framework for opinion influence, proves submodularity of the mean opinion, and extends the model to noisy, heterogeneous communication scenarios.
Findings
Small number of stubborn agents can significantly influence opinions.
Greedy algorithm outperforms benchmarks in real social networks.
Opinion dynamics converge despite noise and heterogeneity.
Abstract
We consider the problem of optimizing the placement of stubborn agents in a social network in order to maximally influence the population. We assume the network contains stubborn users whose opinions do not change, and non-stubborn users who can be persuaded. We further assume the opinions in the network are in an equilibrium that is common to many opinion dynamics models, including the well-known DeGroot model. We develop a discrete optimization formulation for the problem of maximally shifting the equilibrium opinions in a network by targeting users with stubborn agents. The opinion objective functions we consider are the opinion mean, the opinion variance, and the number of individuals whose opinion exceeds a fixed threshold. We show that the mean opinion is a monotone submodular function, allowing us to find a good solution using a greedy algorithm. We find that on real social…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpinion Dynamics and Social Influence · Complex Network Analysis Techniques · Game Theory and Applications
