Efficient networks for a class of games with global spillovers - HAL-SHS - Sciences de l'Homme et de la Société Access content directly
Journal Articles Journal of Mathematical Economics Year : 2015

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.

Dates and versions

halshs-01212128 , version 1 (06-10-2015)

Identifiers

Cite

Pascal Billand, Christophe Bravard, Jacques Durieu, Sudipta Sarangi. Efficient networks for a class of games with global spillovers. Journal of Mathematical Economics, 2015, 61 (December), pp.203-210. ⟨10.1016/j.jmateco.2015.06.019⟩. ⟨halshs-01212128⟩
140 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More