Efficient Shapley-Based Influence Attribution in Social Networks
Fangzhu Shen, Amir Gilad, Sudeepa Roy
Abstract
The ubiquity of social platforms has reshaped the way information, behaviors, and advertisements diffuse across networks, with influence propagation often initiated by a small set of ''seed'' users. While much of the literature emphasizes optimizing seed selection to maximize spread, a critical yet underexplored question remains: how to fairly estimate the contributions of individual seeds ''ex-ante'', i.e., before the diffusion process occurs? This capability is essential for budget allocation, influencer pricing, and fair, privacy-preserving credit distribution under uncertainty, without relying on ex-post cascade logs that capture only a single execution of influence propagation. We introduce a framework for ex-ante influence attribution based on Shapley values from cooperative game theory, which capture each seed's marginal impact in a principled and equitable manner. Adapting Shapley values to influence propagation raises unique computational challenges due to the stochastic nature of diffusion and the intricate dependencies across network structures. To address these challenges, we design polynomial-time algorithms for the special case of single-step activation that is of independent practical interest, establish a sharp tractability boundary by proving #P-hardness for any propagation beyond one step, and develop approximation algorithms with provable guarantees for the standard IC model as well as time-bounded variants. Empirical evaluation on real-world and synthetic networks demonstrates that our methods are both efficient and effective, offering a practical mechanism for ex-ante influence attribution.
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 109861dd-6252-4e8f-b7e3-522f373e893cBuilds on8
- On the Tractability of SHAP ExplanationsGuy Van den Broeck, Anton Lykov, Maximilian Schleich, Dan SuciuAAAI 2021 · 485 citations
- Efficient Sampling Approaches to Shapley Value ApproximationJiayao Zhang, Qiheng Sun, Jinfei Liu, Li Xiong et al.SIGMOD 2023 · 43 citations
- The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean CircuitsMarcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël MonetAAAI 2021 · 37 citations
- Computing the Shapley Value of Facts in Query AnsweringDaniel Deutch, Nave Frost, Benny Kimelfeld, Mikaël MonetSIGMOD 2022 · 31 citations
- GNNShap: Scalable and Accurate GNN Explanation using Shapley ValuesSelahattin Akkas, Ariful AzadWWW 2024 · 31 citations
Related papers
- Analysis of Influence Contribution in Social AdvertisingYuqing Zhu, Jing Tang, Xueyan Tang, Lei ChenVLDB 2022 · 7 citations
- Neural Payoff Machines: Predicting Fair and Stable Payoff Allocations Among Team MembersDaphne Cornelisse, Thomas Rood, Yoram Bachrach, Mateusz Malinowski et al.NeurIPS 2022 · 10 citations
- Fairness in Social Influence Maximization via Optimal TransportShubham Chowdhary, Giulia De Pasquale, Nicolas Lanzetti, Ana-Andreea Stoica et al.NeurIPS 2024 · 6 citations
- Rethinking Shapley Value for Negative Interactions in Non-convex GamesWonjoon Chang, Myeongjin Lee, Jaesik ChoiICLR 2025
- Correlation Robust Influence MaximizationLouis Chen, Divya Padmanabhan, Chee Chin Lim, Karthik NatarajanNeurIPS 2020 · 2 citations
