Efficient networks for a class of games with global spillovers
In this paper we characterize efficient networks for network formation games with global spillovers, that satisfy convexity and sub-modularity properties. This allows us to complete the work of Goyal and Joshi (2006) and Westbrock on collaborative oligopoly networks. In particular, we establish that efficient networks are nested split graphs in this class of games.
Authors: | Sarangi, Sudipta ; Billand, Pascal ; Bravard, Christophe ; Durieu, Jacques |
---|---|
Institutions: | Department of Economics, Ourso College of Business |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Modeling Resource Flow Asymmetries using Condensation Networks
Sarangi, Sudipta,
-
Confirming Information Flows in Networks
Sarangi, Sudipta,
-
Local Spillovers, Convexity and the Strategic Substitutes Property in Networks
Sarangi, Sudipta,
- More ...