Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/151318
Title: Strategic social team crowdsourcing : forming a team of truthful workers for crowdsourcing in social networks
Authors: Wang, Wanyuan
He, Zhanpeng
Shi, Peng
Wu, Weiwei
Jiang, Yichuan
An, Bo
Hao, Zhifeng
Chen, Bing
Keywords: Engineering::Computer science and engineering
Issue Date: 2018
Source: Wang, W., He, Z., Shi, P., Wu, W., Jiang, Y., An, B., Hao, Z. & Chen, B. (2018). Strategic social team crowdsourcing : forming a team of truthful workers for crowdsourcing in social networks. IEEE Transactions On Mobile Computing, 18(6), 1419-1432. https://dx.doi.org/10.1109/TMC.2018.2860978
Journal: IEEE Transactions on Mobile Computing
Abstract: With the increasing complexity of tasks that are crowdsourced, requesters need to form teams of professional workers that can satisfy complex task skill requirements. Team crowdsourcing in social networks (SNs) provides a promising solution for complex task crowdsourcing, where the requester hires a team of professional workers that are also socially connected can work together collaboratively. Previous social team formation approaches have mainly focused on the algorithmic aspect for social welfare maximization; however, within the traditional objective of maximizing social welfare alone, selfish workers can manipulate the crowdsourcing market by behaving untruthfully. This dishonest behavior discourages other workers from participating and is unprofitable for the requester. To address this strategic social team crowdsourcing problem, truthful mechanisms are developed to guarantee that a worker's utility is optimized when he behaves honestly. This problem is proved to NP-hard, and two efficient mechanisms are proposed to optimize social welfare while reducing time complexity for different scale applications. For small-scale applications where the task requires a small number of skills, a binary tree network is first extracted from the social network, and a dynamic programming-based optimal team is formed in the binary tree. For large-scale applications where the task requires a large number of skills, a team is formed greedily based on the workers' social structure, skill, and working cost. For both mechanisms, the threshold payment rule, which pays each worker his marginal value for task completion, is proposed to elicit truthfulness. Finally, the experimental results of a real-world dataset show that compared to the benchmark exponential VCG truthful mechanism, the proposed small-scale-oriented mechanism can reduce computation time while producing nearly the same social welfare results. Furthermore, compared to other state-of-the-art polynomial heuristics, the proposed large-scale-oriented mechanism can achieve truthfulness while generating better social welfare outcomes.
URI: https://hdl.handle.net/10356/151318
ISSN: 1536-1233
DOI: 10.1109/TMC.2018.2860978
Rights: © 2018 IEEE. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

Page view(s)

39
Updated on Oct 24, 2021

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.