{"title":"网络中代理的重要性:基于派系的博弈论方法","authors":"Juping Li, A. Tur, Maksim Zavrajnov","doi":"10.21638/11701/spbu31.2022.14","DOIUrl":null,"url":null,"abstract":"Centrality measures are commonly used to detect important nodes. There are some metrics that measure a node's connectivity to different communities. This paper extends the standard network centrality measures and proposes to estimate the importance of nodes in network as a solution of a cooperative game. Three ways of defining such cooperative game are introduced. Each of them uses the concept of a clique in graph. Examples are considered","PeriodicalId":235627,"journal":{"name":"Contributions to Game Theory and Management","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Importance of Agents in Networks: Clique Based Game-Theoretic Approach\",\"authors\":\"Juping Li, A. Tur, Maksim Zavrajnov\",\"doi\":\"10.21638/11701/spbu31.2022.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Centrality measures are commonly used to detect important nodes. There are some metrics that measure a node's connectivity to different communities. This paper extends the standard network centrality measures and proposes to estimate the importance of nodes in network as a solution of a cooperative game. Three ways of defining such cooperative game are introduced. Each of them uses the concept of a clique in graph. Examples are considered\",\"PeriodicalId\":235627,\"journal\":{\"name\":\"Contributions to Game Theory and Management\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Contributions to Game Theory and Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21638/11701/spbu31.2022.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Contributions to Game Theory and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21638/11701/spbu31.2022.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Importance of Agents in Networks: Clique Based Game-Theoretic Approach
Centrality measures are commonly used to detect important nodes. There are some metrics that measure a node's connectivity to different communities. This paper extends the standard network centrality measures and proposes to estimate the importance of nodes in network as a solution of a cooperative game. Three ways of defining such cooperative game are introduced. Each of them uses the concept of a clique in graph. Examples are considered