The bang for the buck: Fair competitive viral marketing from the host perspective

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn Part F128815, Issue , 2013, Pages 928-936

  Lu, Wei ^a   Bonchi, Francesco ^b   Goyal, Amit ^a   Lakshmanan, Laks V S ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b YAHOO RESEARCH   (Spain)

Author keywords

Influence propagation; Social networks; Viral marketing

Indexed keywords

BUDGET CONTROL; COMMERCE; DATA MINING; SOCIAL NETWORKING (ONLINE);

ALGORITHMIC PROBLEMS; ALLOCATION PROBLEMS; INFLUENTIAL USERS; MONOTONICITY; NETWORK PLATFORMS; PROPAGATION MODELING; SUBMODULARITY; VIRAL MARKETING;

MARKETING;

EID: 85025599759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2487575.2487649     Document Type: Conference Paper

References (20)

1. S. Bharathi, D. Kempe, and M. Salek. Competitive influence maximization in social networks. In WINE'07.
2. A. Borodin, Y. Filmus, and J. Oren. Threshold models for competitive influence in social networks. In WINE'10.
3. C. Budak, D. Agrawal, and A. El-Abbadi. Limiting the spread of misinformation in social networks. In WWW'11.
4. T. Carnes, C. Nagarajan, S. M. Wild, and A. van Zuylen. Maximizing influence in a competitive social network: A follower's perspective. In ICEC'07.
5. W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD'10.
6. W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In ICDM'10.
7. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness.W. H. Freeman & Co., New York, 1979.
8. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. Learning influence probabilities in social networks. In WSDM'10.
9. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. A data-based approach to social influence maximization. PVLDB, 5(1):73-84, 2011.
10. A. Goyal, W. Lu, and L. V. S. Lakshmanan. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM'11.
11. X. He, G. Song, W. Chen, and Q. Jiang. Influence blocking maximization in social networks under the competitive linear threshold model. In SDM'12.
12. T. Hogg and G. Szabó. Diversity of User Activity and Content Quality in Online Communities. In ICWSM'09.
13. D. Kempe, J. M. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD'03.
14. J. M. Kleinberg and É. Tardos. Algorithm design. Addison-Wesley, Massachusetts, 2006.
15. J. Kostka, Y. A. Oswald, and R. Wattenhofer. Word of mouth: Rumor dissemination in social networks. In SIROCCO'08.
16. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. M. VanBriesen, and N. S. Glance. Cost-effective outbreak detection in networks. In KDD'07.
17. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions - i. Mathematical Programming, 14(1):265-294, 1978.
18. N. Pathak, A. Banerjee, and J. Srivastava. A generalized linear threshold model for multiple cascades. In ICDM'10.
19. G. Peng and J. Mu. Technology Adoption in Online Social Networks. Journal of Product Innovation Management, 28(s1):133-145, 2011.
20. S. Zhao, R. Meyer, and J. Han. The Enhancement Bias in Consumer Decisions to Adopt and Utilize Product Innovations Research Collection Lee Kong Chian School of Business (Open Access), 2003.