首页    期刊浏览 2024年11月08日 星期五
登录注册

文章基本信息

  • 标题:On a Centrality Maximization Game
  • 本地全文:下载
  • 作者:Maria Castaldo ; Costanza Catalano ; Giacomo Como
  • 期刊名称:IFAC PapersOnLine
  • 印刷版ISSN:2405-8963
  • 出版年度:2020
  • 卷号:53
  • 期号:2
  • 页码:2844-2849
  • DOI:10.1016/j.ifacol.2020.12.954
  • 语种:English
  • 出版社:Elsevier
  • 摘要:AbstractThe Bonacich centrality is a well-known measure of the relative importance of nodes in a network. This notion is, for example, at the core of Google’s Page Rank algorithm. In this paper we study a network formation game where each player corresponds to a node in the network to be formed. The action of a player consists in the assignment of m out-links and his utility is his own Bonacich centrality. We study the Nash equilibria (NE) and the best response dynamics of this game. In particular, we provide a complete classification of the set of NE when m = 1 and a fairly complete classification of the NE when m = 2. Our analysis shows that the centrality maximization performed by each node tends to create undirected and disconnected or loosely connected networks, namely 2-cliques for m = 1 and rings or a special “Butterfly”-shaped graph when m = 2. Our results build on locality property of the best response function in such game that we formalize and prove in the paper.
  • 关键词:KeywordsNetwork centralitynetwork formationBonacich centralityPageRankgame theorysocial networks
国家哲学社会科学文献中心版权所有