Network Design under Local Complementarities - HAL Accéder directement au contenu
Pré-publication, Document de travail Année : 2013

Network Design under Local Complementarities

Résumé

We consider agents playing a linear network game with strategic complementarities. We analyse the problem of a policy maker who can change the structure of the network in order to increase the aggregate efforts of the individuals and/or the sum of their utilities, given that the number of links of the network has to remain fixed. We identify some link reallocations that guarantee an improvement of aggregate efforts and/or aggregate utilities. With this comparative statics exercise, we then prove that the networks maximising both aggregate outcomes (efforts and utilities) belong to the class of Nested-Split Graphs.
Fichier principal
Vignette du fichier
WP_2013_-_Nr_09.pdf ( 949.44 Ko ) Télécharger
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-00796487, version 1 (04-03-2013)

Identifiants

  • HAL Id : halshs-00796487 , version 1

Citer

Mohamed Belhaj, Sebastian Bervoets, Frédéric Deroïan. Network Design under Local Complementarities. 2013. ⟨halshs-00796487⟩
134 Consultations
187 Téléchargements
Dernière date de mise à jour le 20/04/2024
comment ces indicateurs sont-ils produits

Partager

Gmail Facebook Twitter LinkedIn Plus