HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Efficient networks in games with local complementarities

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.
Complete list of metadata

Contributor : Elisabeth Lhuillier Connect in order to contact the contributor
Submitted on : Friday, March 5, 2021 - 12:39:25 PM
Last modification on : Tuesday, February 8, 2022 - 10:53:45 AM
Long-term archiving on: : Sunday, June 6, 2021 - 6:43:27 PM


Efficient networks in games wi...
Publisher files allowed on an open archive


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License




Mohamed Belhaj, Sebastian Bervoets, Frédéric Deroïan. Efficient networks in games with local complementarities. Theoretical Economics, Econometric Society, 2016, 11 (1), pp.357--380. ⟨10.3982/TE1742⟩. ⟨hal-01446213⟩



Record views


Files downloads