Towards Effective Planning Strategies for Dynamic Opinion Networks
Bharath Muppasani, Protik Nag, Vignesh Narayanan, Biplav Srivastava, Michael N. Huhns
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 82d47e67-cd21-4e1f-a706-10f5bf1f7893Builds on1
Related papers
- Controlling Graph Dynamics with Reinforcement Learning and Graph Neural NetworksEli A. Meirom, Haggai Maron, Shie Mannor, Gal ChechikICML 2021 · 56 citations
- Opinion Maximization in Social Networks by Modifying Internal OpinionsGengyu Wang, Runze Zhang, Zhongzhi ZhangNeurIPS 2025 · 3 citations
- Amortized Network Intervention to Steer the Excitatory Point ProcessesZitao Song, Wendi Ren, Shuang LiICLR 2024 · 1 citation
- Dynamic Gradient Influencing for Viral Marketing Using Graph Neural NetworksSaurabh Sharma, Ambuj K. SinghWWW 2025
- Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and HeuristicsZirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi et al.AAAI 2022
