AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (4.5 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Truthful Mechanism for Crowdsourcing Task Assignment

Yonglong ZhangHaiyan QinBin LiJin WangSungyoung LeeZhiqiu Huang( )
School of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China.
College of Information Engineering, Yangzhou University, Yangzhou 225127, China.
Department of Computer Engineering, Kyung Hee University, Suwon 449-701, Korea.
Show Author Information

Abstract

As an emerging “human problem solving strategy”, crowdsourcing has attracted much attention where requesters want to employ reliable workers to complete specific tasks. Task assignment is an important branch of crowdsourcing. Most existing studies in crowdsourcing have not considered self-interested individuals’ strategy. To guarantee truthfulness, auction has been regarded as a promising method to charge the requesters for the tasks completed and reward the workers for performing the tasks. In this study, an online task assignment scenario is considered where each worker has a set of experienced skills, whereas a specific task is budget-constrained and requires one or more skills. In this scenario, the crowdsourcing task assignment was modeled as a reverse auction where the requesters are buyers and the workers are sellers. Three incentive mechanisms, namely, Truthful Mechanism for Crawdsourcing-Vickrey-Clarke-Grove (TMC-VCG), TMC-Simple Task (ST) for a simple task case, and TMC-Complex Task (CT) for a complex task case are proposed. Here, a simple task case means that the requester asks for a single skill, and a complex task case means that the requester asks for multiple skills. The related properties of each of the three mechanisms are determined theoretically. Moreover, the truthfulness is verified, and other performances are evaluated by extensive simulations.

References

[1]
Howe J., Crowdsourcing: A definition, http://crowdsourcing:typepad:com/cs/2006/06/crowdsourcing a:html, Jun. 2006.
[2]
Slivkins A. and Vaughan J. W., Online decision making in crowdsourcing markets: Theoretical challenges, ACM SIGecom Exchanges, vol. 12, no. 2, pp. 4–23, 2013.
[3]
Amazon Mechanical Turk, http://www.mturk.com/, 2017.
[4]
TopCoder, https://www.topcoder.com/, 2017.
[5]
Chittilappilly A. I., Chen L., and Amer-Yahia S., A survey of general-purpose crowdsourcing techniques, IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 9, pp. 2246–2266, 2016.
[6]
Hassan U. U. and Curry E., Efficient task assignment for spatial crowdsourcing, Expert Systems with Applications: An International Journal, vol. 58, no. C, pp. 36–56, 2016.
[7]
Yang D., Fang X., and Xue G. L., Truthful auction for cooperative communications, in ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2011, pp. 89–98.
[8]
Shi W. J., Zhang L. Q., Wu C., Li Z. P., and Lau F. C. M., An online auction framework for dynamic resource provisioning in cloud computing, IEEE/ACM Transactions on Networking, vol. 24, no. 4, pp. 2060–2073, 2015.
[9]
Jin A. L., Song W., Wang P., Niyato D., and Ju P. J., Auction mechanisms toward efficient resource sharing for cloudlets in mobile cloud computing, IEEE Transactions on Services Computing, vol. 9, no. 6, pp. 895–909, 2015.
[10]
Gujar S. and Faltings B., Auction based mechanisms for dynamic task assignments in expert crowdsourcing, in International Workshop on Agent-Mediated Electronic Commerce and Trading Agents Design and Analysis, 2015.
[11]
Krishna V., Auction theory, Academic Press, vol. 7, no. 3, pp. 289–297, 2002.
[12]
Cheng P., Lian X., Chen L., Han J. S., and Zhao J. Z., Task assignment on multi-skill oriented spatial crowdsourcing, IEEE Transactions on Knowledge and Data Engineering, vol. 28, no. 8, pp. 2201–2215, 2016.
[13]
Assadi S., Hsu J., and Jabbari S., Online assignment of heterogeneous tasks in crowdsourcing markets, in the Third AAAI Conference on Human Computation and Crowdsourcing, 2015, pp. 12–21.
[14]
Yue T., Ali S., and Wang S., An evolutionary and automated virtual team making approach for crowdsourcing platforms, Cloud-Based Software Crowdsourcing, pp. 113–130, 2015.
[15]
Liu Q., Luo T., Tang R. M., and Bressan S., An efficient and truthful pricing mechanism for team formation in crowdsourcing markets, in 2015 IEEE International Conference on Communications (ICC), 2015, pp. 567–572.
[16]
Zhang X., Xue G. L., Yu R. Z., Yang D. J., and Tang J., Truthful incentive mechanisms for crowdsourcing, in 2015 IEEE Conference on Computer Communications (INFOCOM), 2015, pp. 2830–2838.
[17]
Fan Y., Sun H. L., Zhu Y. M., Liu X. D., and Yuan J., A truthful online auction for tempo-spatial crowdsourcing tasks, in 2015 IEEE Symposium on Service-Oriented System Engineering (SOSE), 2015, pp. 332–338.
[18]
Biswas A., Jain S., Mandal D., and Narahari Y., A truthful budget feasible multi-armed bandit mechanism for crowdsourcing time critical tasks, in the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015, pp. 1101–1109.
[19]
Subramanian A.,Kanth G. S., and Vaze R., Offline and online incentive mechanism design for smart-phone crowd-sourcing, arXiv Preprint arXiv: 1310.1746, 2013.
[20]
Myerson R., Optimal auction design, Mathematics of Operations Research, vol. 6, no. 1, pp. 58–73, 1981.
[21]
Gopinathan A., Li Z. P., and Wu C., Strategyproof auctions for balancing social welfare and fairness in secondary spectrum markets, in 2011 Proceedings IEEE INFOCOM, 2011, pp. 3020–3028.
[22]
Gui Y., Zheng Z. Z., Wu F., Gao X. F., Chen G. H., SOAR: Strategy-proof auction mechanisms for distributed cloud bandwidth reservation, in IEEE International Conference on Communication Systems, 2014, pp. 162–166.
[23]
Kameda T. and Munro J. I., A O(|V|*|E|) algorithm for maximum matching of graphs, Computing, vol.12, no. 1, pp. 91–98, 1974.
[24]
Tran-Thanh L., Chapman A., Rogers A., and Jennings N. R., Knapsack based optimal policies for budget-limited multi-armed bandits, in AAAI Conference on Artificial Intelligence, 2012, pp. 1134–1140.
[25]
Tran-Thanh L., Stein S., Rogers A., and Jennings N. R., Efficient crowdsourcing of unknown experts using multi-armed bandits, in European Conference on Artificial Intelligence, 2012, pp. 768–773.
[26]
Parkes D. C., Kalagnanam J., and Eso M., Achieving budget-balance with vickrey-based payment schemes in exchanges, in 17th International Joint Conference on Artificial Intelligence, 2001, pp. 1161–1168.
[27]
Edmonds J. and Karp R. M., Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the ACM (JACM), vol. 19, no. 2, pp. 248–264, 1972.
Tsinghua Science and Technology
Pages 645-659
Cite this article:
Zhang Y, Qin H, Li B, et al. Truthful Mechanism for Crowdsourcing Task Assignment. Tsinghua Science and Technology, 2018, 23(6): 645-659. https://doi.org/10.26599/TST.2018.9010064

519

Views

9

Downloads

4

Crossref

N/A

Web of Science

7

Scopus

1

CSCD

Altmetrics

Received: 23 February 2017
Revised: 17 April 2017
Accepted: 20 April 2017
Published: 15 October 2018
© The authors 2018
Return