Toward a real-time and budget-aware task package allocation in spatial crowdsourcing

被引:39
作者
Wu, Pengkun [1 ,2 ]
Ngai, Eric W. T. [2 ]
Wu, Yuanyuan [1 ]
机构
[1] Harbin Inst Technol, Sch Management, Harbin, Heilongjiang, Peoples R China
[2] Hong Kong Polytech Univ, Dept Management & Mkt, Hong Kong, Hong Kong, Peoples R China
关键词
Spatial crowdsourcing; Task allocation algorithm; Task package; Incentive mechanism; Greedy algorithm; Reputation; INNOVATION CONTESTS; INCENTIVE MECHANISM; MOBILE; DESIGN; GENERATION; FEEDBACK; QUALITY; IDEAS;
D O I
10.1016/j.dss.2018.03.010
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
With the development of mobile technology, spatial crowdsourcing has become a popular approach in collecting data or road information. However, as the number of spatial crowdsourcing tasks becomes increasingly large, the accurate and rapid allocation of tasks to suitable workers has become a major challenge in managing spatial outsourcing. Existing studies have explored the task allocation algorithms with the aim of guaranteeing quality information from workers. However, studies focusing on the task allocation rate when allocating tasks are still lacking despite the increasing unallocated rates of spatial crowdsourcing tasks in the real world. Although the task package is a commonly known scheme used to allocate tasks, it has not been applied to allocate spatial crowdsourcing tasks. To fill these gaps in the literature, we propose a real-time, budget-aware task package allocation for spatial crowdsourcing (RB-TPSC) with the dual objectives of improving the task allocation rate and maximizing the expected quality of results from workers under limited budgets. The proposed RB-TPSC enables spatial crowdsourcing task requester to automatically make key task allocation decisions on the following: (1) to whom should the task be allocated, (2) how much should the reward be for the task, and (3) whether and how the task is packaged with other tasks.
引用
收藏
页码:107 / 117
页数:11
相关论文
共 64 条
[1]  
[Anonymous], 2013, Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems
[2]  
[Anonymous], CALCULATE DISTANCE B
[3]  
[Anonymous], 2012, P 11 INT C AUT AG MU
[4]  
[Anonymous], P 21 ACM SIGSP INT C
[5]  
[Anonymous], DAT ALL SHAR TASKS
[6]  
[Anonymous], 2010, P 6 NORD C HUM COMP, DOI DOI 10.1145/1868914.1868921
[7]  
[Anonymous], IEEE T PARALLEL DIST
[8]  
[Anonymous], 2013, SCIENCE
[9]  
[Anonymous], ONLINE TASK ASSIGNME
[10]   An open-data approach for quantifying the potential of taxi ridesharing [J].
Barann, Benjamin ;
Beverungen, Daniel ;
Muller, Oliver .
DECISION SUPPORT SYSTEMS, 2017, 99 :86-95