Maximizing the spread of influence through a social network using partial incentives

DOI10.1613/JAIR.1.20410MaRDI QIDQ7307235zbMATH OpenFDO

Authors Abhishek K. Umrawal, Eliot W. Robson, Vaneet Aggarwal, Christopher J. Quinn

Publication date 31 July 2026

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1613/JAIR.1.20410

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• An analysis of the greedy algorithm for the submodular set covering problem
• Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling
• Fairness in Influence Maximization through Randomization
• Maximizing a monotone submodular function subject to a matroid constraint
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Maximizing social influence in nearly optimal time
• Optimal approximation for the submodular welfare problem in the value oracle model
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Submodular function maximization in parallel via the multilinear relaxation
• Submodular function maximization via the multilinear relaxation and contention resolution schemes

This page was built for publication: Maximizing the spread of influence through a social network using partial incentives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307235)