Truthful Online Double Auctions for Mobile Crowdsourcing: An On-Demand Service Strategy

被引:15
作者
Liu, Shumei [1 ,2 ]
Yu, Yao [1 ,2 ]
Guo, Lei [3 ]
Yeoh, Phee Lep [4 ]
Ni, Qiang [5 ,6 ]
Vucetic, Branka [4 ]
Li, Yonghui [4 ]
机构
[1] Northeastern Univ, Sch Comp Sci & Engn, Minist Educ, Shenyang 110819, Peoples R China
[2] Northeastern Univ, Key Lab Intelligent Comp Med Image, Minist Educ, Shenyang 110819, Peoples R China
[3] Chongqing Univ Posts & Telecommun, Sch Commun & Informat Engn, Chongqing 400065, Peoples R China
[4] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2006, Australia
[5] Univ Lancaster, Sch Comp & Commun, Lancaster LA1 4WA, England
[6] Univ Lancaster, Data Sci Inst, Lancaster LA1 4WA, England
基金
英国工程与自然科学研究理事会; 中国国家自然科学基金;
关键词
Task analysis; Crowdsourcing; Biological system modeling; Internet of Things; Resource management; Nickel; Data models; Mobile crowdsourcing; on-demand service; online double auction; truthful mechanism design; INCENTIVE MECHANISMS; FRAMEWORK; TASKS;
D O I
10.1109/JIOT.2022.3151924
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Double auctions play a pivotal role in stimulating active participation of a large number of users comprising both task requesters and workers in mobile crowdsourcing. However, most existing studies have concentrated on designing offline two-sided auction mechanisms and supporting single-type tasks and fixed auction service models. Such works ignore the need of dynamic services and are unsuitable for large-scale crowdsourcing markets with extremely diverse demands (i.e., types and urgency degrees of tasks required by different requesters) and supplies (i.e., task skills and online durations of different workers). In this article, we consider a practical crowdsourcing application with an on-demand service strategy. Especially, we innovatively design three online service models, namely, online single-bid single-task (OSS), online single-bid multiple-task (OSM), and online multiple-bid multiple-task (OMM) models to accommodate diversified tasks and bidding demands for different users. Furthermore, to effectively allocate tasks and facilitate bidding, we propose a truthful online double auction mechanism for each service model based on the McAfee double auction. By doing so, each user can flexibly select auction service models and corresponding auction mechanisms according to their current interested tasks and online duration. To illustrate this, we present a three-demand example to explain the effectiveness of our on-demand service strategy in realistic crowdsourcing applications. Moreover, we theoretically prove that our mechanisms satisfy truthfulness, individual rationality, budget balance, and consumer sovereignty. Through extensive simulations, we show that our mechanisms can accommodate the various demands of different users and improve social utility, including platform utility and average user utility.
引用
收藏
页码:16096 / 16112
页数:17
相关论文
共 30 条
[1]   A Distributed Game Methodology for Crowdsensing in Uncertain Wireless Scenario [J].
Cao, Bin ;
Xia, Shichao ;
Han, Jiawei ;
Li, Yun .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2020, 19 (01) :15-28
[2]   Trajectory Penetration Characterization for Efficient Vehicle Selection in HD Map Crowdsourcing [J].
Cao, Xiaofeng ;
Yang, Peng ;
Lyu, Feng ;
Han, Jiarong ;
Li, Yan ;
Guo, Deke ;
Shen, Xuemin .
IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (06) :4526-4539
[3]   A truthful double auction for two-sided heterogeneous mobile crowdsensing markets [J].
Chen, Shuang ;
Liu, Min ;
Chen, Xiao .
COMPUTER COMMUNICATIONS, 2016, 81 :31-42
[4]   A Spatial Mobile Crowdsourcing Framework for Event Reporting [J].
Hamrouni, Aymen ;
Ghazzai, Hakim ;
Frikha, Mounir ;
Massoud, Yehia .
IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2020, 7 (02) :477-491
[5]   An Online Incentive Mechanism for Crowdsensing With Random Task Arrivals [J].
Li, Gang ;
Cai, Jun .
IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (04) :2982-2995
[6]  
Li M., 2018, IEEE CONF COMM NETW, P1
[7]  
Lin J, 2018, IEEE INFOCOM SER, P2438, DOI 10.1109/INFOCOM.2018.8486418
[8]   Incentive Mechanisms for Crowdblocking Rumors in Mobile Social Networks [J].
Lin, Yaguang ;
Cai, Zhipeng ;
Wang, Xiaoming ;
Hao, Fei .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2019, 68 (09) :9220-9232
[9]  
Liu CC, 2017, IEEE INFOCOM SER
[10]   DREAM: Online Control Mechanisms for Data Aggregation Error Minimization in Privacy-Preserving Crowdsensing [J].
Liu, Yang ;
Feng, Tong ;
Peng, Mugen ;
Guan, Jianfeng ;
Wang, Yu .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2022, 19 (02) :1266-1279