Download This PaperEfficient Networks for a Class of Games with Global Spillovers
23 Pages Posted: 23 Dec 2015
Date Written: December 22, 2015
Abstract
In this paper we examine efficient networks in network formation games with global spillovers that satisfy convexity and sub-modularity properties. Unlike the previous literature we impose these properties on individual payoff functions. We establish that efficient networks of this class of games are nested split graphs. This allows us to complete the work of Goyal and Joshi (2006) and Westbrock (2010) on collaborative oligopoly networks.
Keywords: networks, efficiency, convexity, sub-modularity, oligopolies
JEL Classification: C70, D85
Suggested Citation: Suggested Citation
Billand, Pascal and Bravard, Christophe and Durieu, Jacques and Sarangi, Sudipta, Efficient Networks for a Class of Games with Global Spillovers (December 22, 2015). Available at SSRN: https://ssrn.com/abstract=2707233 or http://dx.doi.org/10.2139/ssrn.2707233
Do you have negative results from your research you’d like to share?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.