Attachment centrality: measure for connectivity in networks

DOI10.1016/J.ARTINT.2019.03.002MaRDI QIDQ2321314zbMATH OpenOpenAlexFDO

Authors Oskar Skibski, Talal Rahwan, Makoto Yokoo, Tomasz P. Michalak

Publication date 28 August 2019

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2019.03.002

zbMATH Keywords

networksaxiomatizationcentrality measuresMyerson value

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57) Communication networks in operations research (90B18)

Recommendations

• Axiomatic characterization of game-theoretic centrality
• Efficient computation of semivalues for game-theoretic network centrality
• Centrality and power in social networks: A game theoretic approach.
• A centrality measure for networks with community structure based on a generalization of the Owen value
• Efficient algorithms for game-theoretic betweenness centrality

Cites work

• scientific article; zbMATH DE number 5775796 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• A connectivity game for graphs
• Axiomatic characterization of game-theoretic centrality
• Axioms for Centrality
• Axioms for centrality scoring with principal eigenvectors
• Centrality and power in social networks: A game theoretic approach.
• Characterizations of the - and the degree network power measure
• Coalitional games on sparse social networks
• Cooperative game theoretic centrality analysis of terrorist networks: the cases of Jemaah Islamiyah and Al Qaeda
• Decomposition by clique separators
• Efficient computation of semivalues for game-theoretic network centrality
• Efficient computation of the Shapley value for game-theoretic network centrality
• Generating functions for computing the Myerson value
• Graphs and Cooperation in Games
• Incidence matrices and interval graphs
• Maximum cardinality search for computing minimal triangulations of graphs
• Network Analysis
• Network Analysis
• Network analysis. Methodological foundations.
• Networks. An introduction.
• On the complexity of testing for odd holes and induced odd paths
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Splitting graphs when calculating Myerson value for pure overhead games.
• Statistical and Machine Learning Approaches for Network Analysis
• The Measurement of Intellectual Influence
• The centrality index of a graph
• The complexity of power indexes with graph restricted coalitions
• Values and potential of games with cooperation structure

Cited in

(5)

• Axiomatic characterization of PageRank
• Complexity of computing the Shapley value in partition function form games
• Measuring power in coalitional games with friends, enemies and allies
• Integrating social influence modeling and user modeling for trust prediction in signed networks
• Axiomatic characterization of game-theoretic centrality

This page was built for publication: Attachment centrality: measure for connectivity in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321314)