Local Network Effects and Complex Network Structure
This paper presents a model of local network effects in which agents connected in a social network each value the adoption of a product by a heterogeneous subset of other agents in their neighborhood, and have incomplete information about the structure and strength of adoption complementarities between all other agents. I show that the symmetric Bayes-Nash equilibria of this network game are in monotone strategies, can be strictly Pareto-ranked based on a scalar neighbor-adoption probability value, and that the greatest such equilibrium is uniquely coalition-proof. Each Bayes-Nash equilibrium has a corresponding fulfilled-expectations equilibrium under which agents form local adoption expectations. Examples illustrate cases in which the social network is an instance of a Poisson random graph, when it is a complete graph, a standard model of network effects, and when it is a generalized random graph. A generating function describing the structure of networks of adopting agents is characterized as a function of the Bayes-Nash equilibrium they play, and empirical implications of this characterization are discussed.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 7 (2008)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: https://www.degruyter.com|
|Order Information:||Web: https://www.degruyter.com/view/j/bejte|