Socially Fair Mitigation of Misinformation on Social Networks via Constraint Stochastic Optimization
Ahmed Abouzeid, Ole-Christoffer Granmo, Christian Webersik, Morten Goodwin
[AAAI-22] AI for Social Impact Track
Abstract:
Recent social networks misinformation mitigation approaches tend to investigate how to reduce misinformation by considering a whole-network statistical scale. However, unbalanced misinformation exposures among individuals urge to study fair allocation of mitigation resources. Moreover, the network has random dynamics which change over time. Therefore, we introduce a stochastic and non-stationary knapsack problem, and we apply its solution to mitigate misinformation in social network campaigns. We further propose a generic misinformation mitigation algorithm that is robust to different social networks' misinformation statistics, allowing a promising impact in real-world scenarios. A novel loss function ensures fair mitigation among users. We achieve fairness by intelligently allocating a mitigation incentivization budget to the knapsack, and optimizing the loss function. To this end, a team of Learning Automata (LA) drives the budget allocation. Each LA is associated with a user and learns to minimize its exposure to misinformation by performing a non-stationary and stochastic walk over its state space. Our results show how our LA-based method is robust and outperforms similar misinformation mitigation methods in how the mitigation is fairly influencing the network users.
Introduction Video
Sessions where this paper appears
-
Poster Session 2
Fri, February 25 12:45 AM - 2:30 AM (+00:00)
Red 6
-
Poster Session 5
Sat, February 26 12:45 AM - 2:30 AM (+00:00)
Red 6
-
Oral Session 2
Fri, February 25 2:30 AM - 3:45 AM (+00:00)
Red 6