Towards Effective Planning Strategies for Dynamic Opinion Networks

Bharath Muppasani, Protik Nag, Vignesh Narayanan, Biplav Srivastava, M. Huhns
10/1/2024

No official code found. Best implementation: ai4society/InfoSpread-NeurIPS-24 (2 stars, MIT, last commit 2024-10-28). 1 more below.

Abstract

In this study, we investigate the under-explored intervention planning aimed at disseminating accurate information within dynamic opinion networks by leveraging learning strategies. Intervention planning involves identifying key nodes (search) and exerting control (e.g., disseminating accurate or official information through the nodes) to mitigate the influence of misinformation. However, as the network size increases, the problem becomes computationally intractable. To address this, we first introduce a ranking algorithm to identify key nodes for disseminating accurate information, which facilitates the training of neural network classifiers that provide generalized solutions for the search and planning problems. Second, we mitigate the complexity of label generation, which becomes challenging as the network grows, by developing a reinforcement learning-based centralized dynamic planning framework. We analyze these NN-based planners for opinion networks governed by two dynamic propagation models. Each model incorporates both binary and continuous opinion and trust representations. Our experimental results demonstrate that the ranking algorithm-based classifiers provide plans that enhance infection rate control, especially with increased action budgets for small networks. Further, we observe that the reward strategies focusing on key metrics, such as the number of susceptible nodes and infection rates, outperform those prioritizing faster blocking strategies. Additionally, our findings reveal that graph convolutional network-based planners facilitate scalable centralized plans that achieve lower infection rates (higher control) across various network configurations, including Watts-Strogatz topology, varying action budgets, varying initial infected nodes, and varying degrees of infected nodes.

View on arXivView PDF

Code Implementations(2)

MIT

repository for NeurIPS submission

01Shell, PythonMay 22, 20241 years agoMIT
MIT

Repository for paper "Towards Effective Planning Strategies for Dynamic Opinion Networks"

20Shell, PythonOct 28, 20241 years agoMIT

Similar Papers

Cite this paper

@article{muppasani2024towards,
  title  = {Towards Effective Planning Strategies for Dynamic Opinion Networks},
  author = {Bharath Muppasani and Protik Nag and Vignesh Narayanan and Biplav Srivastava and M. Huhns},
  year   = {2024},
  eprint = {2410.14091},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2410.14091},
  url    = {https://arxiv.org/abs/2410.14091},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.14091.svg)](https://codeofpaper.com/paper/2410.14091)

Discussion