1 research outputs found
Time-Bounded Influence Diffusion with Incentives
A widely studied model of influence diffusion in social networks represents
the network as a graph with an influence threshold for each
node. Initially the members of an initial set are influenced.
During each subsequent round, the set of influenced nodes is augmented by
including every node that has at least previously influenced
neighbours. The general problem is to find a small initial set that influences
the whole network. In this paper we extend this model by using
\emph{incentives} to reduce the thresholds of some nodes. The goal is to
minimize the total of the incentives required to ensure that the process
completes within a given number of rounds. The problem is hard to approximate
in general networks. We present polynomial-time algorithms for paths, trees,
and complete networks.Comment: An extended abstract of this paper was presented at the 25th
International Colloquium on Structural Information and Communication
Complexity (Sirocco 2018) June 18-21, 2018 Ma'ale HaHamisha, Israe