Efficient Networks for a Class of Games with Global Spillovers

23 Pages Posted: 23 Dec 2015

See all articles by Pascal Billand

Pascal Billand

Jean Monnet University

Christophe Bravard

Jean Monnet University, Saint-Etienne - CREUSET

Jacques Durieu

University of Saint Etienne

Sudipta Sarangi

Virginia Polytechnic Institute & State University

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

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

Pascal Billand (Contact Author)

Jean Monnet University ( email )

34, rue Francis Baulier
Saint-Etienne, 42023
France

Christophe Bravard

Jean Monnet University, Saint-Etienne - CREUSET ( email )

34, rue Francis Baulier
Saint-Etienne, 42023
France

Jacques Durieu

University of Saint Etienne ( email )

6, rue basse des rives
Saint Etienne, 42023
France

Sudipta Sarangi

Virginia Polytechnic Institute & State University ( email )

250 Drillfield Drive
Blacksburg, VA 24061
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
13
Abstract Views
345
PlumX Metrics