EconPapers    
Economics at your fingertips  
 

Centralized and decentralized rumor blocking problems

Xin Chen, Qingqin Nong (), Yan Feng, Yongchang Cao, Suning Gong, Qizhi Fang and Ker-I Ko
Additional contact information
Xin Chen: Ocean University of China
Qingqin Nong: Ocean University of China
Yan Feng: Ocean University of China
Yongchang Cao: Ocean University of China
Suning Gong: Ocean University of China
Qizhi Fang: Ocean University of China
Ker-I Ko: Ocean University of China

Journal of Combinatorial Optimization, 2017, vol. 34, issue 1, No 22, 314-329

Abstract: 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.

Keywords: Rumor blocking; 2-Player game; Valid utility system (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0067-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0067-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0067-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0067-z