题目: Maximizing Profit of Multiple Adoptions in Social Networks
报告人: 刘彬, 中国海洋大学数学科学学院 副教授
摘要: The Influence Maximization (IM) problem, which asks for a small node set of maximum influence, has been extensively studied in the literature, and has found important applications in viral marketing, epidemiology, ecology, etc. The traditional IM problem can be naturally extended to the Profit Maximization with Multiple Adoptions problem, which asks for a set of nodes to maximize the overall profit under a given budget. We present a Randomized Modified Greedy algorithm which returns a (1-1/e- )-approximate solution with a high probability. The experimental results on the real-world social networks demonstrate that our algorithm offers a much better performance guarantee than the state-of-the-art methods.