Network Design under Local Complementarities

Fiche du document

Type de document
Périmètre
Langue
Identifiants
Collection

Archives ouvertes

Licence

info:eu-repo/semantics/OpenAccess




Citer ce document

Mohamed Belhaj et al., « Network Design under Local Complementarities », HAL SHS (Sciences de l’Homme et de la Société), ID : 10670/1.d5a139...


Métriques


Partage / Export

Résumé 0

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.

document thumbnail

Par les mêmes auteurs

Sur les mêmes sujets

Sur les mêmes disciplines