five

Table1_An Adversarial Dynamic Game to Controlling Information Diffusion under Typical Strategies on Online Social Networks.XLSX

收藏
NIAID Data Ecosystem2026-03-13 收录
下载链接:
https://figshare.com/articles/dataset/Table1_An_Adversarial_Dynamic_Game_to_Controlling_Information_Diffusion_under_Typical_Strategies_on_Online_Social_Networks_XLSX/20744155
下载链接
链接失效反馈
官方服务:
资源简介:
The diffusion of negative information, such as rumours, misinformation and computer viruses on Online Social Networks (OSNs), may lead to serious losses and consequences. And there are always some rational malicious spreaders, who strategically spread negative information. Therefore, how to control the information diffusion of the malicious spreader is a great challenge. In recent years, some studies have analyzed the controlling problem which belongs to the issue of influence blocking maximization (IBM) from the perspective of the large-scale strategy set on the game theory. However, the aforementioned methods cannot timely solve the controlling diffusion problem on high-speed OSNs. In this study, we achieve the purpose of effectively controlling diffusion on OSNs by blocking information under typical strategies. Based on the existing two-player Stackelberg zero-sum game model and evaluation methods of node’s importance on the network, we analyze the typical strategic dynamic game in which the blocker moves first and the spreader moves later on scale-free networks with different power exponent. Experimental results show that the absolute dominance strategy of the blocker is Leader Rank with 90.16% probability. And using Leader Rank can be relatively effective against malicious spreaders with 98.33% probability. When the power exponent of the network is smaller, it is more conducive to blocking information dissemination with fewer seed nodes.
创建时间:
2022-08-31
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

面向社区/商业的数据集话题

二维码
科研交流群

面向高校/科研机构的开源数据集话题

数据驱动未来

携手共赢发展

商业合作