Existence of Nash networks in one-way flow models
This paper addresses the existence of Nash networks for the one-way flow model of Bala and Goyal (2000) in a number of different settings. First, we provide conditions for he existence of Nash networks in models where costs and values of links are heterogenous and players obtain resources from others only through the directed path between them. We find that costs of establishing links play a vital role in the existence of Nash networks. Next we examine the existence of Nash networks when there are congestion effects in the model. Then, we provide conditions for the existence of Nash networks in a model where a player’s payoff depends on the number of links she has established as well as on the number of links that other players in the population have created. More precisely, we show that convexity and increasing (decreasing) differences allow for the existence of Nash networks.
(This abstract was borrowed from another version of this item.)
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): 37 (2008)
Issue (Month): 3 (December)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hans Haller & Sudipta Sarangi, 2003.
"Nash Networks with Heterogeneous Agents,"
Discussion Papers of DIW Berlin
337, DIW Berlin, German Institute for Economic Research.
- Galeotti, Andrea & Goyal, Sanjeev & Kamphorst, Jurjen, 2006.
"Network formation with heterogeneous players,"
Games and Economic Behavior,
Elsevier, vol. 54(2), pages 353-372, February.
- Billand, Pascal & Bravard, Christophe, 2005. "A note on the characterization of Nash networks," Mathematical Social Sciences, Elsevier, vol. 49(3), pages 355-365, May.
- Xavier Vives, 2001. "Oligopoly Pricing: Old Ideas and New Tools," MIT Press Books, The MIT Press, edition 1, volume 1, number 026272040x, June.
- Sudipta Sarangi & Hans Haller & Jurjen Kamphorst, .
"(Non-)Existence and Scope of Nash Networks,"
Departmental Working Papers
2005-14, Department of Economics, Louisiana State University.
- Andrea Galeotti, 2006. "One-way flow networks: the role of heterogeneity," Economic Theory, Springer, vol. 29(1), pages 163-179, September.
- Matthew O. Jackson & Asher Wolinsky, 1995.
"A Strategic Model of Social and Economic Networks,"
1098R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Haller, Hans & Sarangi, Sudipta, 2005. "Nash networks with heterogeneous links," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 181-201, September.
- Sudipta Sarangi & Pascal Billand & Christophe Bravard, . "Heterogeneity in Nash Networks," Departmental Working Papers 2006-18, Department of Economics, Louisiana State University.
- Billand, P. & Bravard, C., 2004. "Non-cooperative networks in oligopolies," International Journal of Industrial Organization, Elsevier, vol. 22(5), pages 593-609, May.
- Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:37:y:2008:i:3:p:491-507. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.