Name
Abstract | ||
|---|---|---|
Recently the influence maximization problem has received much attention for its applications on viral marketing and product promotions. However, such influence maximization problems have not taken into account the monetary effect on the purchasing decision of individuals. To fulfill this gap, in this paper, we aim for maximizing the revenue by considering the quantity constraint on the promoted commodity. For this problem, we not only identify a proper small group of individuals as seeds for promotion but also determine the pricing of the commodity. To tackle the revenue maximization problem, we first introduce a strategic searching algorithm, referred to as Algorithm PRUB, which is able to derive the optimal solutions. After that, we further modify PRUB to propose a heuristic, Algorithm PRUB+IF, for obtaining feasible solutions more efficiently on larger instances. Experiments on real social networks with different valuation distributions demonstrate the effectiveness of PRUB and PRUB+IF. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2783258.2783282 | ACM Knowledge Discovery and Data Mining |
Field | DocType | Volume |
Revenue,Marketing strategy,Heuristic,Viral marketing,Mathematical optimization,Search algorithm,Computer science,Artificial intelligence,Purchasing,Valuation (finance),Maximization,Machine learning | Journal | abs/1505.06286 |
Citations | PageRank | References |
3 | 0.39 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ya-Wen Teng | 1 | 8 | 2.81 |
| Chih-Hua Tai | 2 | 119 | 10.20 |
| Philip S. Yu | 3 | 30670 | 3474.16 |
| Ming Chen | 4 | 6507 | 1277.71 |