Stackelberg Game Based Incentive Mechanisms for Multiple Collaborative Tasks in Mobile Crowdsourcing

被引:28
作者
Luo, Shuyun [1 ]
Sun, Yongmei [1 ]
Ji, Yuefeng [1 ]
Zhao, Dong [2 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China
[2] Beijing Univ Posts & Telecommun, Beijing Key Lab Intelligent Telecomm Software & M, Beijing 100876, Peoples R China
基金
中国博士后科学基金;
关键词
Mobile croudsourcing; Multiple collaborative tasks; Incentive mechanism; Stackelberg game;
D O I
10.1007/s11036-015-0659-3
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we tackle the problem of stimulating users to join mobile crowdsourcing applications with personal devices such as smartphones and tablets. Wireless personal networks facilitate to exploit the communication opportunity and makes diverse spare-resource of personal devices utilized. However, it is a challenge to motivate sufficient users to provide their resource of personal devices for achieving good quality of service. To address this problem, we propose an incentive framework based on Stackelberg game to model the interaction between the server and users. Traditional incentive mechanisms are applied for either single task or multiple dependent tasks, which fails to consider the interrelation among various tasks. In this paper, we focus on the common realistic scenario with multiple collaborative tasks, where each task requires a group of users to perform collaboratively. Specifically, participants would consider task priority and the server would design suitable reward functions to allocate the total payment. Considering the information of users' costs and the types of tasks, four incentive mechanisms are presented for various cases to the above problem, which are proved to have the Nash equilibrium solutions in all cases for maximizing the utility of the server. Moreover, online incentive mechanisms are further proposed for real time tasks. Through both rigid theoretical analysis and extensive simulations, we demonstrate that the proposed mechanisms have good performance and high computational efficiency in real world applications.
引用
收藏
页码:506 / 522
页数:17
相关论文
共 21 条
[1]   A Reputation Framework for Social Participatory Sensing Systems [J].
Amintoosi, Haleh ;
Kanhere, Salil S. .
MOBILE NETWORKS & APPLICATIONS, 2014, 19 (01) :88-100
[2]  
[Anonymous], 2013, Proceedings of the 22nd WWW
[3]   Utility-based bandwidth allocation algorithm for heterogeneous wireless networks [J].
Chai Rong ;
Wang XiuJuan ;
Chen QianBin ;
Svensson, Tommy .
SCIENCE CHINA-INFORMATION SCIENCES, 2013, 56 (02) :95-107
[4]  
Cormen T. H., 2009, Introduction to Algorithms
[5]  
Duan LJ, 2012, IEEE INFOCOM SER, P1701, DOI 10.1109/INFCOM.2012.6195541
[6]  
Elkind E., 2004, ACM SIAM S DISCRETE, P701
[7]  
Feng Z, 2014, P IEEE
[8]  
Jaimes LG, 2012, INT CONF PERVAS COMP, P103, DOI 10.1109/PerCom.2012.6199855
[9]   Beyond VCG: Frugality of truthful mechanisms [J].
Karlin, AR ;
Kempe, D ;
Tamir, T .
46TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2005, :615-624
[10]  
Ledlie Jonathan., 2010, ACM SIGOPS Operating Systems Review, V43, P84, DOI DOI 10.1145/1713254.1713273