Parallelization of game theoretic centrality algorithms

DOI10.1007/S12046-015-0425-ZMaRDI QIDQ301779zbMATH OpenOpenAlexFDO

Authors M. Sankar, B. Ravindran

Publication date 1 July 2016

Published in Sādhanā (Search for Journal in Brave)

Full work available at URL https://www.ias.ac.in/describe/article/sadh/040/06/1821-1843

zbMATH Keywords

game theorysocial networkscentralityparallelizationHadooopMap-Reduce

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30) Noncooperative games (91A10) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient algorithms for game-theoretic betweenness centrality
• Efficient computation of semivalues for game-theoretic network centrality
• A parallel algorithm for non-cooperative resource allocation games
• Efficient computation of the Shapley value for game-theoretic network centrality
• Distributed computation of Pareto solutions in n-player games
• Game-theoretic centrality measures for weighted graphs
• Distributed algorithms for aggregative games on graphs
• Development and analysis of high performance parallel algorithms for solving cooperative games
• Distributed Algorithms for Computation of Centrality Measures in Complex Networks

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 53256 (Why is no real title available?)
• Efficient computation of the Shapley value for game-theoretic network centrality

Cited in

(1)

• Distributed centrality analysis of social network data using MapReduce

Describes a project that uses

Uses Software

• MapReduce
• Hadoop

This page was built for publication: Parallelization of game theoretic centrality algorithms

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