Optimal Pricing in Networks with Externalities

Published Online:https://doi.org/10.1287/opre.1120.1066

References

  • Akhlaghpour H, Ghodsi M, Haghpanah N, Mirrokni V, Mahini H, Nikzad A, Saberi A. Optimal iterative pricing over social networks. WINE 2010 (2010) 6484(Springer, Berlin) 415–423Lecture Notes in Computer ScienceCrossrefGoogle Scholar
  • Ballester C, Calvo-Armengol A, Zenou Y. Who's who in networks. Wanted: The key player. Econometrica (2006) 74(5):1403–1417CrossrefGoogle Scholar
  • Bloch F, Quérou N. Pricing in social networks. (2011) . Working paper, Ecole Polytechnique, Palaiseau, FranceGoogle Scholar
  • Bonacich P. Power and centrality: A family of measures. Amer. J. Sociol. (1987) 92(5):1170–1182CrossrefGoogle Scholar
  • Bramoullé Y, Kranton R. Public goods in networks. J. Econom. Theory (2007) 135:478–494CrossrefGoogle Scholar
  • Bramoullé Y, Kranton R, D'Amours M. Strategic interaction and networks. (2012) . Working paper, CIRPÉE, Université Laval, Quebec City, Quebec, CanadaGoogle Scholar
  • Campbell A. Tell your friends! Word of mouth and percolation in social networks. (2012) . Working paper, School of Management, Yale University, New Haven, CTGoogle Scholar
  • Corbo J, Calvó-Armengol A, Parkes D, Deng X, Grahan F. The importance of network topology in local contribution games. Internet and Network Economics (2007) 4858(Springer, Berlin) 388–395Lecture Notes in Computer ScienceCrossrefGoogle Scholar
  • Farrell J, Saloner G. Standardization, compatibility, and innovation. RAND J. Econom. (1985) 16(1):70–83CrossrefGoogle Scholar
  • Galeotti A, Goyal S. Influencing the influencers: A theory of strategic diffusion. RAND J. Econom. (2009) 40(3):509–532CrossrefGoogle Scholar
  • Galeotti A, Goyal S, Jackson M, Vega-Redondo F, Yariv L. Network games. Rev. Econom. Stud. (2010) 77(1):218–244CrossrefGoogle Scholar
  • Garey MR, Johnson DS. Computers and Intractability. A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences (1979) (WH Freeman and Company, San Francisco) Google Scholar
  • Goemans M, Williamson D. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (1995) 42(6):1115–1145CrossrefGoogle Scholar
  • Golub GH, Van Loan CF. Matrix Computations (1996) (Johns Hopkins University Press, Baltimore) Google Scholar
  • Haghpanah N, Immorlica N, Mirrokni V, Munagala K. Optimal auctions with positive network externalities. Proc. 12th ACM Conf. Electronic Commerce (2011) (ACM, New York) 11–20CrossrefGoogle Scholar
  • Hartline J, Mirrokni V, Sundararajan M. Optimal marketing strategies over social networks. Proc. 17th Internat. Conf. World Wide Web (WWW '08) (2008) (ACM, New York) 189–198CrossrefGoogle Scholar
  • Horn RA, Johnson CR. Matrix Analysis (2005) (Cambridge University Press, Cambridge, UK) Google Scholar
  • Johari R, Kumar S. Congestible services and network effects. Proc. 11th ACM Conf. Electronic Commerce (2010) (ACM, New York) CrossrefGoogle Scholar
  • Katz M, Shapiro C. Technology adoption in the presence of network externalities. J. Political Econom. (1986) 94(4):822–841CrossrefGoogle Scholar
  • Kempe D, Kleinberg J, Tardos É. Maximizing the spread of influence through a social network. Proc. 9th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining (2003) (ACM, New York) 137–146CrossrefGoogle Scholar
  • Sundararajan A. Local network effects and complex network structure. The BE J. Theoret. Econom. (2007) 7(1). Article 46Google Scholar
  • Topkis DM. Supermodularity and Complementarity (1998) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.