Abstract-In the practical crowdsourcing systems, there exist many cooperative tasks, each of which requires a group of users to perform together, such as nding the shortest multi-hop path or obtaining the media resources from a set of hosts. In this paper, we tackle the problem of how to truthfully and fairly schedule or allocate suf cient users who join mobile crowdsourcing applications with their smartphones. Moreover, the cooperation among users is taken into account. Thus, we present a novel Cooperative Crowdsourcing (C 2 ) auction mechanism for crowdsourcing multiple cooperative tasks. C 2 contains two parts: user selection and payment computation. In the rst part, we rst prove that users selection with the minimum social cost is NP hard problem and design a greedy algorithm to achieve near-optimal solution in polynomial time. The other part is that the server determines the payments of selected users to avoid the bidder's cheating behavior through a pricing algorithm that if and only if users honestly bid their cost, they can obtain the maximum utility. Both theoretical analysis and extensive simulations demonstrate that C 2 auction achieves not only truthfulness, individual rationality and high computational ef ciency, but also low overpayment ratio.
Luo et al. REF have presented an auction mechanism for multiple cooperative tasks to minimize the server's payment under the condition that the server earns the targeted value.
C2: Truthful incentive mechanism for multiple cooperative tasks in mobile cloud
2016 IEEE International Conference on Communications (ICC)
2016 IEEE International Conference on Communications (ICC)
Computer Science