Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Efficient networks for a class of games with global spillovers

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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://halshs.archives-ouvertes.fr/halshs-01247683
Contributor : Taï Dao Connect in order to contact the contributor
Submitted on : Tuesday, December 22, 2015 - 3:30:50 PM
Last modification on : Monday, April 11, 2022 - 1:58:03 PM
Long-term archiving on: : Sunday, April 30, 2017 - 12:04:55 AM

File

1537.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : halshs-01247683, version 1

Citation

Pascal Billand, Christophe Bravard, Jacques Durieu, Sudipta Sarangi. Efficient networks for a class of games with global spillovers. 2015. ⟨halshs-01247683⟩

Share

Metrics

Record views

143

Files downloads

254