IPIM: An Effective Contribution-Driven Information Propagation Incentive Mechanism

被引:1
作者
Chang, Fei [2 ]
Yang, Guangcheng [2 ]
Qi, Jianpeng [2 ]
Wang, Ying [2 ]
Xu, Shijun [2 ]
Wang, Jigang [2 ]
Wang, Rui [1 ,2 ]
机构
[1] Univ Sci & Technol Beijing, Sch Comp & Commun Engn, Beijing 100083, Peoples R China
[2] Univ Sci & Technol Beijing, Inst Artificial Intelligence, Beijing 100083, Peoples R China
关键词
Incentive mechanism; social network; information propagation; ego network; DIFFUSION;
D O I
10.1109/ACCESS.2019.2917504
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The wide diffusion of information in social networks can be exploited to solve searching-for-a-target (SFT) problems including those of missing individuals. Incentive mechanisms that promote active individual participation can be designed to favor a clear propagation direction to help efficiently find a target. However, the existing incentive research rarely focuses on a clear propagation direction based on a specific goal. Thus, we propose an effective contribution-driven information propagation incentive mechanism (IPIM) that exploits ego networks to solve the SFT problem. First, we use an all-pay auction-inspired model to determine the propagation of alters in each ego network. We then propose a novel algorithm, the node propagation utility, based on effective contributions, to focus the propagation toward the target rather than searching indiscriminately and inefficiently. The theoretical analyses and simulation results indicate that IPIM guarantees the truthfulness, individual rationality, and budget feasibility. The simulations are conducted based on real and public social datasets. The IPIM shows increased efficiencies of 951.18 % of success rate, of 215.65 % in propagation hops, and of 514.41 % in participation scale, compared with a typical incentive mechanism. In conclusion, the IPIM shows significant value in the potential application in SFT.
引用
收藏
页码:77362 / 77373
页数:12
相关论文
共 29 条
[11]   Incentive Mechanism Design for Heterogeneous Crowdsourcing Using All-Pay Contests [J].
Luo, Tie ;
Kanhere, Salil S. ;
Das, Sajal K. ;
Tan, Hwee-Pink .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2016, 15 (09) :2234-2246
[12]   Incentive Mechanism Design for Crowdsourcing: An All-Pay Auction Approach [J].
Luo, Tie ;
Das, Sajal K. ;
Tan, Hwee Pink ;
Xia, Lirong .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2016, 7 (03)
[13]  
Mtibaa A., 2010, P 29 C INFORM COMMUN, P111
[14]   OPTIMAL AUCTION DESIGN [J].
MYERSON, RB .
MATHEMATICS OF OPERATIONS RESEARCH, 1981, 6 (01) :58-73
[15]   Incentive Mechanisms for Data Dissemination in Autonomous Mobile Social Networks [J].
Ning, Ting ;
Liu, Yang ;
Yang, Zhipeng ;
Wu, Hongyi .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2017, 16 (11) :3084-3099
[16]  
Ok J, 2017, IEEE INFOCOM SER
[17]   Clustering in weighted networks [J].
Opsahl, Tore ;
Panzarasa, Pietro .
SOCIAL NETWORKS, 2009, 31 (02) :155-163
[18]   On the Design of a Reward-Based Incentive Mechanism for Delay Tolerant Networks [J].
Seregina, Tatiana ;
Brun, Olivier ;
El-Azouzi, Rachid ;
Prabhu, Balakrishna J. .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2017, 16 (02) :453-465
[19]   An Incentive Framework for Mobile Data Offloading Market Under Price Competition [J].
Shah-Mansouri, Hamed ;
Wong, Vincent W. S. ;
Huang, Jianwei .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2017, 16 (11) :2983-2999
[20]   Linear Threshold Discrete-Time Recurrent Neural Networks: Stability and Globally Attractive Sets [J].
Shen, Tao ;
Petersen, Ian R. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (09) :2650-2656