Details of Research Outputs

Coupon advertisement is everywhere in people's daily lives, and it is a common marketing strategy adopted by merchants. A problem, Budget Profit Maximization with Coupon Advertisement, is formulated in this article, which is a branch of classical profit maximization problem in social networks. Profit maximization has been researched intensively before, but its theoretical bound is not satisfactory usually because of NP-hardness, budget constraint and non-monotonicity. Learned from the lastest results, we proposed the B-Framework, which combines the ideas of Random Greedy and Continuous Double Greedy to obtain a more acceptable approximation ratio for this problem. For Continuous Double Greedy, it can be implemented by multilinear extension and discretized techniques. In addition, most of existing researches consider only maximizing total profit, however, in real scenarios, the diffusion probability is hard to determine due to the uncertainty. Then, we study the robustness for budgeted profit maximization, which can be used as a general strategy to analyze the robustness of non-monotone submodular function. It aims to obtain the best solution maximizing the ratio between the profit of any feasible seed set and the optimal seed set. We design LU-B-Framework first, and then we apply the method of uniform sampling to improve the robustness by reducing the uncertainty. The effectiveness and correctness of our algorithms are evaluated by heavy simulation on real-world social networks eventually.