Optimal Pricing in the Presence of Local Network Effects

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 agents1, 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.

[1]  A. Galeotti,et al.  Influencing the influencers: a theory of strategic diffusion , 2009 .

[2]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[3]  Sunil Kumar,et al.  Congestible services and network effects , 2010, EC '10.

[4]  Jeffrey K. MacKie-Mason,et al.  Pricing Congestible Network Resources (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[5]  Arun Sundararajan,et al.  Local Network Effects and Complex Network Structure , 2006 .

[6]  C. Shapiro,et al.  Technology Adoption in the Presence of Network Externalities , 1986, Journal of Political Economy.

[7]  Éva Tardos,et al.  Network games , 2004, STOC '04.

[8]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[9]  Joseph Farrell,et al.  Standardization, Compatibility, and Innovation , 1985 .

[10]  Antoni Calvó-Armengol,et al.  Centre De Referència En Economia Analítica Barcelona Economics Working Paper Series Working Paper Nº 178 Who's Who in Networks. Wanted: the Key Player Who's Who in Networks. Wanted: the Key Player Barcelona Economics Wp Nº 178 , 2022 .

[11]  Yann Bramoullé,et al.  Public goods in networks , 2007, J. Econ. Theory.

[12]  P. Bonacich Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[13]  Vahab S. Mirrokni,et al.  Optimal marketing strategies over social networks , 2008, WWW.

[14]  Arthur Campbell Tell Your Friends! Word of Mouth and Percolation in Social Networks , 2008 .

[15]  Rachel Kranton,et al.  Strategic Interaction and Networks , 2010 .

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  D. M. Topkis Supermodularity and Complementarity , 1998 .

[18]  David C. Parkes,et al.  The Importance of Network Topology in Local Contribution Games , 2007, WINE.