Efficient parallel computing on the game theory-aware robust influence maximization problem

作者：

Highlights：

• Present a novel mechanism combining network RIM problem and game theory.

• It is the first work to use the Shapley value to model and solve the RIM problem.

• Newly introduce one realistic/uncertain IC model with centrality measures.

• The proposed algorithm outperforms latest methods under the worst diffusion case.

• The novel parallel computing based framework is efficient for RIM solving.

摘要

•Present a novel mechanism combining network RIM problem and game theory.•It is the first work to use the Shapley value to model and solve the RIM problem.•Newly introduce one realistic/uncertain IC model with centrality measures.•The proposed algorithm outperforms latest methods under the worst diffusion case.•The novel parallel computing based framework is efficient for RIM solving.

论文关键词：Robust influence maximization,Centrality measurement,Shapley value,Cooperative networks,Parallel computing

论文评审过程：Received 19 August 2020, Revised 13 December 2020, Accepted 8 March 2021, Available online 15 March 2021, Version of Record 19 March 2021.

论文官网地址：https://doi.org/10.1016/j.knosys.2021.106942