Advertisement

Social Network Analysis and Mining

, Volume 3, Issue 4, pp 1249–1262 | Cite as

Revenue maximization in social networks through discounting

  • Mahmoudreza Babaei
  • Baharan Mirzasoleiman
  • Mahdi Jalili
  • Mohammad Ali Safari
Original Article

Abstract

Social networking has become a part of daily life for many individuals across the world. Widespread adoption of various strategies in such networks can be utilized by business corporations as a powerful means for advertising. In this study, we investigated viral marketing strategies in which buyers are influenced by other buyers who already own an item. Since finding an optimal marketing strategy is NP-hard, a simple strategy has been proposed in which giving the item for free to a subset of influential buyers in a network increases the valuation of the other potential buyers for the item. In this study, we considered the more general problem by offering discounts instead of giving the item for free to an initial set of buyers. We introduced three approaches for finding an appropriate discount sequence based on the following iterative idea: In each step, we offer the item to the potential buyers with a discounted price in a way that they all accept the offers and buy the product. Selling the item to the most influential buyers as the opinion leaders increases the willingness of other buyers to pay a higher price. Thus, in the following steps, we can offer the item with a lower discount while still guaranteeing the acceptance of the offers. Furthermore, we investigated two marketing strategies based on local search and hill climbing algorithms. Extensive computational experiments on artificially constructed model networks as well as on a number of real-world networks revealed the effectiveness of the proposed discount-based strategies.

Keywords

Pricing Monetizing social networks Viral marketing Revenue maximization Influence models Discounting 

Notes

Acknowledgments

We would like to thank Dr. S. V. Mirrokni for his support and insightful comments throughout preparing this manuscript.

References

  1. Agarwal N, Liu H et al (2012) Modeling blogger influence in a community. Soc Netw Anal Min 2(2):139–162MathSciNetCrossRefGoogle Scholar
  2. Anari N, Ehsani S et al (2010) Equilibrium pricing with positive externalities. Internet Netw Econ 6484:424–431Google Scholar
  3. Babaei M, Ghassemieh H et al (2011) Cascading failure tolerance of modular small-world networks. IEEE Trans Circuits Syst II Express Briefs 58(8):1–5CrossRefGoogle Scholar
  4. Backstrom L, Huttenlocher D et al (2006) Group formation in large social networks: membership, growth, and evolution. ACM, New YorkGoogle Scholar
  5. Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509MathSciNetCrossRefGoogle Scholar
  6. Cabral L, Salant DJ et al (1999) Monopoly pricing with network externalities. Int J Ind Organ 17(2):199–214CrossRefGoogle Scholar
  7. Cha M, Perez JAN et al (2011) The spread of media content through blogs. Soc Netw Anal Min 1–16. doi: 10.1007/s13278-011-0040-x
  8. Chen D, Lu L et al (2011) Identifying influential nodes in complex networks. Phys A Stat Mech Appl 391(4):1777–1787Google Scholar
  9. Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pp 57–66Google Scholar
  10. Engel JF, Kollat DT et al (1968) Consumer behavior. Holt, Rinehart and Winston, New YorkGoogle Scholar
  11. Feige U, Mirrokni VS et al (2007). Maximizing non-monotone submodular functions. In: Proceedings of the 48th annual IEEE/symposium on Foundations of computer science, pp 461–471Google Scholar
  12. Gehrke J, Ginsparg P et al (2003) Overview of the 2003 KDD Cup. ACM SIGKDD Explor Newsl 5(2):149–151CrossRefGoogle Scholar
  13. Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821MathSciNetCrossRefGoogle Scholar
  14. Goyal A, Bonchi F et al (2012) On minimizing budget and time in influence propagation over social networks. Soc Netw Anal Min 1–14. doi: 10.1007/s13278-012-0062-z
  15. Goyal A, Bonchi F et al (2010) Learning influence probabilities in social networks. In: Proceedings of the third ACM international conference on web search and data mining, New York, pp 241-250Google Scholar
  16. Hartline J, Mirrokni V et al (2008) Optimal marketing strategies over social networks. In: Proceedings of the 17th international conference on World Wide Web, pp 189–198Google Scholar
  17. Jackson MO, Yariv L (2006) Diffusion on social networks. Economie publique/Public Econ 1(16):69–82Google Scholar
  18. Kempe D, Kleinberg J et al (2003) 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–146Google Scholar
  19. Kempe D, Kleinberg J et al (2005) Influential nodes in a diffusion model for social networks. Automata Lang Program 3580(99)Google Scholar
  20. Kitsak M, Gallos LK et al (2010) Identification of influential spreaders in complex networks. Nat Phys 6(11):888–893CrossRefGoogle Scholar
  21. Kourtellis N, Alahakoon T et al (2012) Identifying high betweenness centrality nodes in large social networks. Soc Netw Anal Min 1–16. doi: 10.1007/s13278-012-0076-6
  22. Leskovec J, Huttenlocher D et al (2010a) Predicting positive and negative links in online social networks. In: Proceedings of the 19th international conference on World Wide Web, pp 641–650Google Scholar
  23. Leskovec J, Huttenlocher D et al (2010b) Signed networks in social media. In: Proceedings of the 28th international conference on Human factors in computing systems, pp 1361–1370Google Scholar
  24. Leskovec J, Kleinberg J et al (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data (TKDD) 1(1):1–40CrossRefGoogle Scholar
  25. Nemhauser GL, Wolsey LA et al (1978) An analysis of approximations for maximizing submodular set functions—I. Math Program 14(1):265–294MathSciNetCrossRefzbMATHGoogle Scholar
  26. Newman MEJ (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci USA 98(2):404MathSciNetCrossRefzbMATHGoogle Scholar
  27. Newman MEJ (2005) Power laws, Pareto distributions and Zipf’s law. Contemp Phys 46(5):323–351CrossRefGoogle Scholar
  28. Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103(23):8577CrossRefGoogle Scholar
  29. Olshavsky RW, Granbois DH (1979) Consumer decision making—fact or fiction? J Consumer Res 6(2):93–100CrossRefGoogle Scholar
  30. Opsahl T, Panzarasa P (2009) Clustering in weighted networks. Social networks 31(2):155–163CrossRefGoogle Scholar
  31. Perc M (2009) Evolution of cooperation on scale-free networks subject to error and attack. New J Phys 11:033027CrossRefGoogle Scholar
  32. Perc M, Szolnoki A (2010) Coevolutionary games—a mini review. BioSystems 99(2):109–125CrossRefGoogle Scholar
  33. Perc M, Szolnoki A et al (2008) Restricted connections among distinguished players support cooperation. Phys Rev E 78(6):066101CrossRefGoogle Scholar
  34. Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 61–70Google Scholar
  35. Saaskilahti P (2007) Monopoly pricing of social goods. MPRA Paper 3526, University Library of Munich, GermanyGoogle Scholar
  36. Salop SC (1979) Monopolistic competition with outside goods. Bell J Econ 10(1):141–156CrossRefGoogle Scholar
  37. Shokat-Fadaee S (2010) Analysis of effective algorithms in social networks. Master of Science Software Engineering, Sharif University of Technology, Computer Engineering DepartmentGoogle Scholar
  38. Szolnoki A, Perc M et al (2008) Making new connections towards cooperation in the prisoner’s dilemma game. EPL (Europhysics Letters) 84:50007CrossRefGoogle Scholar
  39. Valente TW (1996) Social network thresholds in the diffusion of innovations. Social Networks 18(1):69–89MathSciNetCrossRefGoogle Scholar
  40. Zaidi F (2012) Small world networks and clustered small world networks with random connectivity. Soc Netw Anal Min 1–13. doi: 10.1007/s13278-012-0052-1

Copyright information

© Springer-Verlag Wien 2012

Authors and Affiliations

  • Mahmoudreza Babaei
    • 1
  • Baharan Mirzasoleiman
    • 1
  • Mahdi Jalili
    • 1
  • Mohammad Ali Safari
    • 1
  1. 1.Department of Computer EngineeringSharif University of TechnologyTehranIran

Personalised recommendations