Adaptive Submodular Influence Maximization with Myopic Feedback
Abstract
This paper examines the problem of adaptive influence maximization in social networks. As adaptive decision making is a time-critical task, a realistic feedback model has been considered, called myopic. In this direction, we propose the myopic adaptive greedy policy that is guaranteed to provide a (1 - 1/e)-approximation of the optimal policy under a variant of the independent cascade diffusion model. This strategy maximizes an alternative utility function that has been proven to be adaptive monotone and adaptive submodular. The proposed utility function considers the cumulative number of active nodes through the time, instead of the total number of the active nodes at the end of the diffusion. Our empirical analysis on real-world social networks reveals the benefits of the proposed myopic strategy, validating our theoretical results.
Cite
@article{arxiv.1704.06905,
title = {Adaptive Submodular Influence Maximization with Myopic Feedback},
author = {Guillaume Salha and Nikolaos Tziortziotis and Michalis Vazirgiannis},
journal= {arXiv preprint arXiv:1704.06905},
year = {2018}
}
Comments
Accepted by IEEE/ACM International Conference Advances in Social Networks Analysis and Mining (ASONAM), 2018