TY - GEN
T1 - Attachment centrality
T2 - 15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016
AU - Skibski, Oskar
AU - Rahwan, Talal
AU - Michalak, Tomasz P.
AU - Yokoo, Makoto
N1 - Funding Information:
Oskar Skibski and Makoto Yokoo were supported by JSPS KAKENHI Grant (24220003). Tomasz Michalak were supported by the European Research Council under Advanced Grant 291528 ("RACE"). This work was also supported the Polish National Science Center grant DEC-2013/09/D/ST6/03920.
Publisher Copyright:
Copyright © 2016, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
PY - 2016
Y1 - 2016
N2 - Centrality indices aim to quantify the importance of nodes or edges in a network. A number of new centrality indices have recently been proposed to try and capture the role of nodes in connecting the network. While these indices seem to deliver new insights, to date not enough is known about their theoretical properties. To address this issue, we propose an axiomatic approach. Specifically, we prove that there exists a unique centrality index satisfying some intuitive properties related to network connectivity. This new index, which we call Attachment Centrality, is equivalent to the Myerson value of a particular graph-restricted coalitional game. Building upon our theoretical analysis, we show that our Attachment Centrality has certain computational properties that are more attractive than the Myerson value for an arbitrary game.
AB - Centrality indices aim to quantify the importance of nodes or edges in a network. A number of new centrality indices have recently been proposed to try and capture the role of nodes in connecting the network. While these indices seem to deliver new insights, to date not enough is known about their theoretical properties. To address this issue, we propose an axiomatic approach. Specifically, we prove that there exists a unique centrality index satisfying some intuitive properties related to network connectivity. This new index, which we call Attachment Centrality, is equivalent to the Myerson value of a particular graph-restricted coalitional game. Building upon our theoretical analysis, we show that our Attachment Centrality has certain computational properties that are more attractive than the Myerson value for an arbitrary game.
KW - Axiomatization
KW - Network centrality
UR - http://www.scopus.com/inward/record.url?scp=85014198132&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85014198132&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85014198132
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 168
EP - 176
BT - AAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Y2 - 9 May 2016 through 13 May 2016
ER -