Parallelization of game theoretic centrality algorithms

DOI10.1007/S12046-015-0425-ZzbMATH Open1339.05403OpenAlexW2264596019MaRDI QIDQ301779FDOQ301779

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality

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)