Title
Centralized and decentralized rumor blocking problems.
Abstract
This paper consists of two parts. In the first part, we study a centralized rumor blocking problem with a novel social objective function different from those in the literature. We will show that this objective function is non-decreasing and submodular and hence corresponding rumor blocking problem has a greedy approximation with objective function value at least $$1-1/e$$1-1/e of the optimal. In the second part, we study a decentralized rumor blocking problem with two selfish protectors, which falls into a 2-player non-cooperate game model. We will show that this game is a basic valid utility system and hence the social utility of any Nash equilibrium in the game is at least a half of the optimal social utility.
Year
DOI
Venue
2017
10.1007/s10878-016-0067-z
J. Comb. Optim.
Keywords
Field
DocType
Rumor blocking, 2-Player game, Valid utility system
Greedy approximation,Mathematical economics,Mathematical optimization,Rumor,Submodular set function,Nash equilibrium,Mathematics,Utility system
Journal
Volume
Issue
ISSN
34
1
1573-2886
Citations 
PageRank 
References 
3
0.41
9
Authors
7
Name
Order
Citations
PageRank
Chen Xin1625120.92
Q. Q. Nong2476.24
Yan Feng330.75
Yongchang Cao4101.92
Suning Gong530.41
Qizhi Fang683.97
Ker-I Ko730.41