Influence Maximization With Co-Existing Seeds
Becker, Ruben; D'Angelo, Gianlorenzo; Gilbert, Hugo (2021), Influence Maximization With Co-Existing Seeds, CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, ACM - Association for Computing Machinery : New York, NY, p. 100–109. 10.1145/3459637.3482439
TypeCommunication / Conférence
External document linkhttps://hal.archives-ouvertes.fr/hal-03501078
Conference titleCIKM '21: The 30th ACM International Conference on Information and Knowledge Management
Book titleCIKM '21: The 30th ACM International Conference on Information and Knowledge Management
MetadataShow full item record
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)In the classical influence maximization problem we aim to select a set of nodes, called seeds, to start an efficient information diffusion process. More precisely, the goal is to select seeds such that the expected number of nodes reached by the diffusion process is maximized. In this work we study a variant of this problem where an unknown (up to a probability distribution) set of nodes, referred to as co-existing seeds, joins in starting the diffusion process even if not selected. This setting allows to model that, in certain situations, some nodes are willing to act as "voluntary seeds'' even if not chosen by the campaign organizer. This may for example be due to the positive nature of the information campaign (e.g., public health awareness programs, HIV prevention, financial aid programs), or due to external social driving effects (e.g., nodes are friends of selected seeds in real life or in other social media).In this setting, we study two types of optimization problems. While the first one aims to maximize the expected number of reached nodes, the second one endeavors to maximize the expected increment in the number of reached nodes in comparison to a non-intervention strategy. The problems (particularly the second one) are motivated by cooperative game theory. For various probability distributions on co-existing seeds, we obtain several algorithms with approximation guarantees as well as hardness and hardness of approximation results. We conclude with experiments that demonstrate the usefulness of our approach when co-existing seeds exist.
Subjects / KeywordsGraph algorithms; Social networks
Showing items related by title and author.
Angriman, Eugenio; Becker, Ruben; D'Angelo, Gianlorenzo; Gilbert, Hugo; van der Grinten, Alexander; Meyerhenke, Henning (2021) Communication / Conférence