最大化社会网络中购买者人数

Maximizing the Spread of Adopting Nodes over Social Networks

在线性阈值模型和独立级联模型基础上引入商品价格、个人估值因素,同时商家以优惠券形式触发信息扩散过程,由此得到新的推广模型.考虑在新模型下将最终处在购买状态的人数最大化,证明该问题的目标函数是单调递增且关于种子集是次模的,且可用贪心算法求得(1-1/e)-近似解.

Introduce product price and personal valuation based on LC Model and IT Model,and the merchant trigger the propagation process by giving coupons,then get the new generalization models.Consider to maximize the number of adopting nodes at the end of the propagation process under the new models,to prove the objective functions are monotone increasing and submodular w.r.t.seeds set,then can use Greedy Algorithm to find solution of such problem.