There are many situations in which a customer's proclivity to buy the product of any firm depends not only on the classical attributes of the product such as its price and quality, but also on who else is buying the same product. We model these situations as games in which firms compete for customers located in a “social network”. Nash Equilibrium (NE) in pure strategies exist and are unique. Indeed there are closed-form formulae for the NE in terms of the exogenous parameters of the model, which enables us to compute NE in polynomial time.
An important structural feature of NE is that, if there are no a priori biases between customers and firms, then there is a cut-off level above which high cost firms are blockaded at an NE, while the rest compete uniformly throughout the network.
We finally explore the relation between the connectivity of a customer and the money firms spend on him. This relation becomes particularly transparent when externalities are dominant: NE can be characterized in terms of the invariant measures on the recurrent classes of the Markov chain underlying the social network.
[1]
Hal R. Varian,et al.
Information rules - a strategic guide to the network economy
,
1999
.
[2]
Daniel A. Keim,et al.
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
,
2002,
KDD.
[3]
C. N. Moore.
Summability of Series
,
1932
.
[4]
Matthew Richardson,et al.
Mining the network value of customers
,
2001,
KDD '01.
[5]
Oz Shy.
The Economics of Network Industries
,
2001
.
[6]
Ramakrishnan Srikant,et al.
Kdd-2001: Proceedings of the Seventh Acm Sigkdd International Conference on Knowledge Discovery and Data Mining : August 26-29, 2001 San Francisco, Ca, USA
,
2002
.
[7]
Matthew O. Jackson,et al.
The Economics of Social Networks
,
2005
.
[8]
Rahul Garg,et al.
Competing for Customers in a Social Network
,
2006
.
[9]
Matthew Richardson,et al.
Mining knowledge-sharing sites for viral marketing
,
2002,
KDD.
[10]
John Scott.
Social Network Analysis
,
1988
.