Hiring a Team From Social Network: Incentive Mechanism Design for Two-Tiered Social Mobile Crowdsourcing

Mobile crowdsourcing has become an efficient paradigm for performing large scale tasks. The incentive mechanism is important for the mobile crowdsourcing system to stimulate participants, and to achieve good service quality. In this paper, we focus on solving the insufficient participation problem for the budget constrained online crowdsourcing system. We present a two-tiered social crowdsourcing architecture, which can enable the selected registered users to recruit their social neighbors by diffusing the tasks to their social circles. We present three system models for two-tiered social crowdsourcing system based on the arrival modes of registered users and social neighbors: offline model, semi-online model, and full-online model. We consider the tasks are associated with different end times. We present an incentive mechanism for each of three system models. Through both rigorous theoretical analysis and extensive simulations, we demonstrate that the proposed incentive mechanisms achieve computational efficiency, individual rationality, budget feasibility, cost truthfulness, and time truthfulness. We further show that our incentive mechanisms for semi-online model and full-online model can obtain averagely 51.1
$\%$
and 39.7
$\%$
value of approximate optimal untruthful offline algorithm, respectively.