Skip to main content

Pricing Strategies for Viral Marketing on Social Networks

  • Conference paper
Book cover Internet and Network Economics (WINE 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5929))

Included in the following conference series:

Abstract

We study the use of viral marketing strategies on social networks that seek to maximize revenue from the sale of a single product. We propose a model in which the decision of a buyer to buy the product is influenced by friends that own the product and the price at which the product is offered. The influence model we analyze is quite general, naturally extending both the Linear Threshold model and the Independent Cascade model, while also incorporating price information. We consider sales proceeding in a cascading manner through the network, i.e. a buyer is offered the product via recommendations from its neighbors who own the product. In this setting, the seller influences events by offering a cashback to recommenders and by setting prices (via coupons or discounts) for each buyer in the social network. This choice of prices for the buyers is termed as the seller’s strategy.

Finding a seller strategy which maximizes the expected revenue in this setting turns out to be NP-hard. However, we propose a seller strategy that generates revenue guaranteed to be within a constant factor of the optimal strategy in a wide variety of models. The strategy is based on an influence-and-exploit idea, and it consists of finding the right trade-off at each time step between: generating revenue from the current user versus offering the product for free and using the influence generated from this sale later in the process.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arthur, D., Motwani, R., Sharma, A., Xu, Y.: Pricing strategies for viral marketing on social networks (2009), http://arxiv.org/abs/0902.3485

  2. Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: SODA 2007: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 1027–1035. Society for Industrial and Applied Mathematics (2007)

    Google Scholar 

  3. Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 57–66 (2001)

    Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman & Co., New York (1979)

    MATH  Google Scholar 

  5. Hartline, J., Mirrokni, V., Sundararajan, M.: Optimal Marketing Strategies over Social Networks. In: Proceedings of the 17th international conference on World Wide Web (2008)

    Google Scholar 

  6. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 137–146 (2003)

    Google Scholar 

  7. Kleinberg, J.: Cascading Behavior in Networks: Algorithmic and Economic Issues. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory. Cambridge University Press, New York (2007)

    Google Scholar 

  8. Kleitman, D.J., West, D.B.: Spanning Trees with Many Leaves. SIAM Journal on Discrete Mathematics 4, 99 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Leskovec, J., Singh, A., Kleinberg, J.: Patterns of influence in a recommendation network. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 380–389. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web 1(1), 5 (2007)

    Article  Google Scholar 

  11. Lu, H.I., Ravi, R.: Approximating Maximum Leaf Spanning Trees in Almost Linear Time. Journal of Algorithms 29(1), 132–141 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. BBC News. Facebook valued at $15 billion (2007), http://news.bbc.co.uk/2/hi/business/7061042.stm

  13. Schonfeld, E.: Amiando makes tickets go viral and widgetizes event management (2008), http://www.techcrunch.com/2008/07/17/amiando-makes-tickets-go-viral-and-widgetizes-event-management-200-discount-for-techcrunch-readers/

  14. Solis-Oba, R.: 2-Approximation Algorithm for finding a Spanning Tree with Maximum Number of leaves. In: Proceedings of the Sixth European Symposium on Algorithms, pp. 441–452 (1998)

    Google Scholar 

  15. Wikipedia. Facebook revenue in 2008 (2008), http://en.wikipedia.org/wiki/Facebook

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arthur, D., Motwani, R., Sharma, A., Xu, Y. (2009). Pricing Strategies for Viral Marketing on Social Networks. In: Leonardi, S. (eds) Internet and Network Economics. WINE 2009. Lecture Notes in Computer Science, vol 5929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10841-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10840-2

  • Online ISBN: 978-3-642-10841-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics