Robust Opinion Maximization

Abstract

Opinion-formation models are fundamental for analyzing social behavior and understanding social dynamics. The Friedkin-Johnsen (FJ) model is the most commonly used model in this line of research. In FJ, the expressed opinion of an individual evolves over time as the combination of the opinions of their peers and a fixed inner opinion, weighted by their stubbornness. A problem that has received considerable attention is the problem of Opinion Maximization, where the goal is to adjust the parameters of the FJ model, such as stubbornness, or inner opinions, to maximize the average expressed opinion, i.e., the public opinion. Most existing work assumes full knowledge of the parameters of the model, which is unrealistic. In this paper, we introduce the problem of Robust Opinion Maximization, where we assume uncertainty for the inner opinions of the nodes, and we maximize the public opinion under worst-case assumptions on this uncertainty. Using tools from Robust Optimization, we formulate our problem as a max-min problem, and we develop an optimal two-step solution that is both highly intuitive and efficient. Experiments on several real-world networks demonstrate that our approach can achieve robust solutions for million-node graphs in minutes, and reveal that our robust strategies can significantly mitigate the impact of noise compared to standard baselines.