Abstract
Social networks often serve as a medium for the diffusion of ideas or innovations. An individual’s decision whether to adopt a product or innovation will be highly dependent on the choices made by the individual’s peers or neighbors in the social network. In this work, we study the game of innovation diffusion with multiple competing innovations such as when multiple companies market competing products using viral marketing. Our first contribution is a natural and mathematically tractable model for the diffusion of multiple innovations in a network. We give a (1 − 1/e) approximation algorithm for computing the best response to an opponent’s strategy, and prove that the “price of competition” of this game is at most 2. We also discuss “first mover” strategies which try to maximize the expected diffusion against perfect competition. Finally, we give an FPTAS for the problem of maximizing the influence of a single player when the underlying graph is a tree.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. 7th KDD, pp. 57–66 (2001)
Goldenberg, J., Libai, B., Muller, E.: Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12, 211–223 (2001)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence in a social network. In: Proc. 9th KDD, pp. 137–146 (2003)
Kempe, D., Kleinberg, J., Tardos, E.: Influential nodes in a diffusion model for social networks. In: Proc. 32nd ICALP (2005)
Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: Proc. 38th ACM STOC (2007)
Hotelling, H.: Stability in competition. The Economic Journal 39, 41–57 (1929)
Ahn, H., Cheng, S., Cheong, O., Golin, M., van Oostrom, R.: Competitive facility location along a highway. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 237–246. Springer, Heidelberg (2001)
Cheong, O., Har-Peled, S., Linial, N., Matoušek, J.: The one-round voronoi game. Discrete And Computational Geometry 31, 125–138 (2004)
Lotker, Z., Patt-Shamir, B., M.R.T.: Publish and perish: definition and analysis of an n-person publication impact game. In: Proc. 18th ACM SPAA, pp. 11–18 (2006)
Dubey, P., Garg, R., de Meyer, B.: Competing for customers in a social network: The quasi-linear case. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, Springer, Heidelberg (2006)
Vetta, A.: Nash equlibria in competitive societies with applications to facility location, traffic routing and auctions. In: Proc. 43rd IEEE FOCS, pp. 416–425 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bharathi, S., Kempe, D., Salek, M. (2007). Competitive Influence Maximization in Social Networks. In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-77105-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77104-3
Online ISBN: 978-3-540-77105-0
eBook Packages: Computer ScienceComputer Science (R0)