IPIM: An Effective Contribution-Driven Information Propagation Incentive Mechanism

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.

[1]  Honggang Zhang,et al.  Incentive mechanism for proximity-based Mobile Crowd Service systems , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[2]  Bo Gao,et al.  Incentivizing spectrum sensing in database-driven dynamic spectrum sharing , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[3]  Ian R. Petersen,et al.  Linear Threshold Discrete-Time Recurrent Neural Networks: Stability and Globally Attractive Sets , 2016, IEEE Transactions on Automatic Control.

[4]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[5]  Liang Liu,et al.  Quality of video oriented pricing incentive for mobile video offloading , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[6]  Xiaoying Gan,et al.  Social Crowdsourcing to Friends: An Incentive Mechanism for Multi-Resource Sharing , 2017, IEEE Journal on Selected Areas in Communications.

[7]  Ruggiero Cavallo,et al.  GSP: The Cinderella of Mechanism Design , 2017, WWW.

[8]  Jinwoo Shin,et al.  Incentivizing strategic users for social diffusion: Quantity or quality? , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[9]  Adam Wierman,et al.  Prices and subsidies in the sharing economy , 2019, Perform. Evaluation.

[10]  Ling Liu,et al.  Probabilistic Diffusion of Social Influence with Incentives , 2014, IEEE Transactions on Services Computing.

[11]  Hwee Pink Tan,et al.  Incentive Mechanism Design for Heterogeneous Crowdsourcing Using All-Pay Contests , 2016, IEEE Transactions on Mobile Computing.

[12]  L. Friedman A Competitive-Bidding Strategy , 1956 .

[13]  Balakrishna J. Prabhu,et al.  On the Design of a Reward-Based Incentive Mechanism for Delay Tolerant Networks , 2017, IEEE Transactions on Mobile Computing.

[14]  Vincent W. S. Wong,et al.  An Incentive Framework for Mobile Data Offloading Market Under Price Competition , 2017, IEEE Transactions on Mobile Computing.

[15]  Bin Guo,et al.  Toward estimating user-social event distance: mobility, content, and social relationship , 2016, UbiComp Adjunct.

[16]  Xiang-Yang Li,et al.  How to crowdsource tasks truthfully without sacrificing utility: Online incentive mechanisms with budget constraint , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[17]  Hwee Pink Tan,et al.  Incentive Mechanism Design for Crowdsourcing , 2016, ACM Trans. Intell. Syst. Technol..

[18]  Qinghua Zheng,et al.  Towards Information Diffusion in Mobile Social Networks , 2016, IEEE Transactions on Mobile Computing.

[19]  A. Vasilakos,et al.  Socially Aware Networking: A Survey , 2013, IEEE Systems Journal.

[20]  Chao Lan,et al.  Learning Social Circles in Ego-Networks Based on Multi-View Network Structure , 2017, IEEE Transactions on Knowledge and Data Engineering.

[21]  Zhiming Xu,et al.  Learning distributed representations for large-scale dynamic social networks , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[22]  Shaojie Tang,et al.  A Budget Feasible Incentive Mechanism for Weighted Coverage Maximization in Mobile Crowdsensing , 2017, IEEE Transactions on Mobile Computing.

[23]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[24]  Guangyue Lu,et al.  Social Incentives for Cooperative Spectrum Sensing in Distributed Cognitive Radio Networks , 2014, KSII Trans. Internet Inf. Syst..

[25]  Feng Wang,et al.  Dispersing Social Content in Mobile Crowd through Opportunistic Contacts , 2017, 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS).

[26]  Hongyi Wu,et al.  Incentive Mechanisms for Data Dissemination in Autonomous Mobile Social Networks , 2017, IEEE Transactions on Mobile Computing.

[27]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.