{"title":"Provision of non-excludable public goods on networks: From equilibrium to centrality measures","authors":"Parinaz Naghizadeh Ardabili, M. Liu","doi":"10.1109/ALLERTON.2015.7446986","DOIUrl":null,"url":null,"abstract":"We consider the provision of non-excludable public goods on a network of interdependent strategic users. We study three different equilibria of these games, namely the Nash equilibrium, socially optimal, and exit equilibrium profiles. We identify properties of the interdependence graph that guarantee the existence and uniqueness of these equilibria. We further establish a connection between users' centralities in their interdependence network, and their efforts at different interior equilibria of these games. These characterizations separate the effects of incoming and outgoing dependencies, as well as the influence of paths of different length, on users' effort levels. We discuss some conceptual and practical implications of this centrality-effort connection.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7446986","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
We consider the provision of non-excludable public goods on a network of interdependent strategic users. We study three different equilibria of these games, namely the Nash equilibrium, socially optimal, and exit equilibrium profiles. We identify properties of the interdependence graph that guarantee the existence and uniqueness of these equilibria. We further establish a connection between users' centralities in their interdependence network, and their efforts at different interior equilibria of these games. These characterizations separate the effects of incoming and outgoing dependencies, as well as the influence of paths of different length, on users' effort levels. We discuss some conceptual and practical implications of this centrality-effort connection.