Skip to main content

On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities

  • Conference paper
Internet and Network Economics (WINE 2012)

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

Included in the following conference series:

Abstract

We consider the marketing model of (Hartline, Mirrokni, Sundararajan, WWW ’08) for selling a digital product in a social network under positive externalities. The seller seeks for a marketing strategy, namely an ordering in which he approaches the buyers and the prices offered to them, that maximizes her revenue. We restrict our attention to the Uniform Additive Model of externalities, and mostly focus on Influence-and-Exploit (IE) marketing strategies. We show that in undirected social networks, revenue maximization is NP-hard not only when we search for a general optimal marketing strategy, but also when we search for the best IE strategy. Rather surprisingly, we observe that allowing IE strategies to offer prices smaller than the myopic price in the exploit step leads to a significant improvement on their performance. Thus, we show that the best IE strategy approximates the maximum revenue within a factor of 0.911 for undirected and of roughly 0.553 for directed networks. Utilizing a connection between good IE strategies and large cuts in the underlying social network, we obtain polynomial-time algorithms that approximate the revenue of the best IE strategy within a factor of roughly 0.9. Hence, we significantly improve on the best known approximation ratio for the maximum revenue to 0.8229 for undirected and to 0.5011 for directed networks (from 2/3 and 1/3, respectively).

This work was supported by the project AlgoNow, co-financed by the European Union (European Social Fund - ESF) and Greek national funds, through the Operational Program “Education and Lifelong Learning”, under the research funding program Thales, and by an NTUA Basic Research Grant (PEBE 2009).

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Akhlaghpour, H., Ghodsi, M., Haghpanah, N., Mirrokni, V.S., Mahini, H., Nikzad, A.: Optimal Iterative Pricing over Social Networks (Extended Abstract). In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 415–423. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Alizadeh, F.: Interior point methods in Semidefinite Programming with applications to combinatorial optimization. SIAM J. on Optimization 5, 13–51 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Anari, N., Ehsani, S., Ghodsi, M., Haghpanah, N., Immorlica, N., Mahini, H., Mirrokni, V.S.: Equilibrium Pricing with Positive Externalities (Extended Abstract). In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 424–431. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Arthur, D., Motwani, R., Sharma, A., Xu, Y.: Pricing Strategies for Viral Marketing on Social Networks. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 101–112. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Candogan, O., Bimpikis, K., Ozdaglar, A.: Optimal Pricing in the Presence of Local Network Effects. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 118–132. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Chen, W., Lu, P., Sun, X., Tang, B., Wang, Y., Zhu, Z.A.: Optimal Pricing in Social Networks with Incomplete Information. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 49–60. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. of the 7th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2001), pp. 57–66. ACM (2001)

    Google Scholar 

  8. Feige, U., Goemans, M.X.: Aproximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In: Proc. of the 3rd Israel Symposium on Theory of Computing and Systems, pp. 182–189 (1995)

    Google Scholar 

  9. Fotakis, D., Krysta, P., Telelis, O.: Externalities among Advertisers in Sponsored Search. In: Persiano, G. (ed.) SAGT 2011. LNCS, vol. 6982, pp. 105–116. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)

    Google Scholar 

  11. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for Maximum Cut and Satisfiability problems using Semidefinite Programming. J. Assoc. Comput. Mach. 42, 1115–1145 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Guruswami, V., Manokaran, R., Raghavendra, P.: Beating the random ordering is hard: Inapproximability of Maximum Acyclic Subgraph. In: Proc. of the 49th IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 573–582 (2008)

    Google Scholar 

  13. Haghpanah, N., Immorlica, N., Mirrokni, V.S., Munagala, K.: Optimal auctions with positive network externalities. In: Proc. of the 12th ACM Conference on Electronic Commerce (EC 2011), pp. 11–20 (2011)

    Google Scholar 

  14. Hartline, J., Mirrokni, V.S., Sundararajan, M.: Optimal marketing strategies over social networks. In: Proc. of the 17th International Conference on World Wide Web (WWW 2008), pp. 189–198 (2008)

    Google Scholar 

  15. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proc. of the 9th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), pp. 137–146 (2003)

    Google Scholar 

  16. Naor, J., Feldman, M., Schwartz, R.: A tight linear time 0.5-approximation for unconstrained submodular maximization. In: Proc. of the 53rd IEEE Symposium on Foundations of Computer Science (FOCS 2012) (to appear, 2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fotakis, D., Siminelakis, P. (2012). On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities. In: Goldberg, P.W. (eds) Internet and Network Economics. WINE 2012. Lecture Notes in Computer Science, vol 7695. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35311-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35311-6_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35310-9

  • Online ISBN: 978-3-642-35311-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics