Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/150280
Authors: 
Belhaj, Mohamed
Bervoets, Sebatian
Deroïan, Frédéric
Year of Publication: 
2016
Citation: 
[Journal:] Theoretical Economics [ISSN:] 1555-7561 [Volume:] 11 [Year:] 2016 [Issue:] 1 [Pages:] 357-380
Abstract: 
We address the problem of a planner looking for the efficient network when agents play a network game with local complementarities and links are costly. We show that for general network cost functions, efficient networks belong to the class of Nested-Split Graphs. Next, we refine our results and find that, depending on the specification of the network cost function, complete networks, core-periphery networks, dominant group architectures, quasi-star and quasi-complete networks can be efficient.
Subjects: 
Network games
strategic complementarity
nested split graphs
JEL: 
C72
D85
Persistent Identifier of the first edition: 
Creative Commons License: 
https://creativecommons.org/licenses/by-nc/3.0/
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.