Optimal Pricing in the Presence of Local Network Effects

  • Ozan Candogan
  • Kostas Bimpikis
  • Asuman Ozdaglar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)

Abstract

We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that consumers experience a (positive) local network effect. In particular, each consumer’s usage level depends directly on the usage of her neighbors in the social network structure. Thus, the monopolist’s optimal pricing strategy may involve offering discounts to certain agents, who have a central position in the underlying network. Our results can be summarized as follows. First, we consider a setting where the monopolist can offer individualized prices and derive an explicit characterization of the optimal price for each consumer as a function of her network position. In particular, we show that it is optimal for the monopolist to charge each agent a price that is proportional to her Bonacich centrality in the social network. In the second part of the paper, we discuss the optimal strategy of a monopolist that can only choose a single uniform price for the good and derive an algorithm polynomial in the number of agents to compute such a price. Thirdly, we assume that the monopolist can offer the good in two prices, full and discounted, and study the problem of determining which set of consumers should be given the discount. We show that the problem is NP-hard, however we provide an explicit characterization of the set of agents that should be offered the discounted price. Finally, we describe an approximation algorithm for finding the optimal set of agents. We show that if the profit is nonnegative under any feasible price allocation, the algorithm guarantees at least 88 % of the optimal profit.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ballester, C., Calvo-Armengol, A., Zenou, Y.: Who’s who in networks. wanted: the key player. Econometrica 74(5), 1403–1417 (2006)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bonacich, P.: Power and centrality: A family of measures. The American Journal of Sociology 92(5), 1170–1182 (1987)CrossRefGoogle Scholar
  3. 3.
    Bramoullé, Y., Kranton, R.: Public goods in networks. Journal of Economic Theory 135, 478–494 (2007)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bramoullé, Y., Kranton, R., D’Amours, M.: Strategic interaction and networks. Working paper (2009)Google Scholar
  5. 5.
    Campbell, A.: Tell your friends! word of mouth and percolation in social networks. Working paper (2009)Google Scholar
  6. 6.
    Candogan, O., Bimpikis, K., Ozdaglar, A.: Optimal pricing in the presence of local network effects. Working paper (2010)Google Scholar
  7. 7.
    Corbo, J., Calvo-Armengol, A., Parkes, D.C.: The importance of network topology in local contribution games. In: Proceedings of the 3rd International Workshop on Internet and Network Economics (2007)Google Scholar
  8. 8.
    Farrell, J., Saloner, G.: Standardization, compatibility, and innovation. RAND Journal of Economics 16(1), 70–83 (1985)CrossRefGoogle Scholar
  9. 9.
    Galeotti, A., Goyal, S.: Influencing the influencers: a theory of strategic diffusion. RAND Journal of Economics 40(3), 509–532 (2009)CrossRefGoogle Scholar
  10. 10.
    Galeotti, A., Goyal, S., Jackson, M., Vega-Redondo, F., Yariv, L.: Network games. Review of Economic Studies 77(1), 218–244 (2010)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. WH Freeman and Company, San Francisco (1979)MATHGoogle Scholar
  12. 12.
    Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42(6), 1115–1145 (1995)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    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
  14. 14.
    Johari, R., Kumar, S.: Congestible services and network effects. Working paper (2010)Google Scholar
  15. 15.
    Katz, M., Shapiro, C.: Technology adoption in the presence of network externalities. Journal of Political Economy 94(4), 822–841 (1986)CrossRefGoogle Scholar
  16. 16.
    Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)Google Scholar
  17. 17.
    MacKie-Mason, J., Varian, H.: Pricing congestible network resources. IEEE Journal of Selected Areas in Communications (1995)Google Scholar
  18. 18.
    Sundararajan, A.: Local network effects and complex network structure. The BE Journal of Theoretical Economics 7(1) (2007)Google Scholar
  19. 19.
    Topkis, D.M.: Supermodularity and complementarity. Princeton University Press, Princeton (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Ozan Candogan
    • 1
  • Kostas Bimpikis
    • 2
  • Asuman Ozdaglar
    • 1
  1. 1.Laboratory for Information and Decision SystemsMITUSA
  2. 2.Operations Research Center and Laboratory for Information and Decision SystemsMITUSA

Personalised recommendations