{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T18:28:05Z","timestamp":1779906485036,"version":"3.53.1"},"reference-count":42,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:00:00Z","timestamp":1613952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["201801D121151"],"award-info":[{"award-number":["201801D121151"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,19]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Task allocation plays a vital role in crowd computing by determining its performance. The power of crowd computing stems from a large number of workers potentially available to provide high quality of service and reduce costs. An important challenge in the crowdsourcing market today is the task allocation of crowdsourcing workflows. Task allocation aims to maximize the completion quality of the entire workflow and minimize its total cost. Trust can affect the quality of the produced results and costs. Selecting workers with high levels of trust could provide better solution to the workflow and increase the budget. Crowdsourcing workflow needs to balance the two conflicting objectives. In this paper, we propose an alternative greedy approach with four heuristic strategies to address the issue. In particular, the proposed approach aims to monitor the current status of workflow execution and use heuristic strategies to adjust the parameters of task allocation. We design a two-phase allocation model to accurately match the tasks with workers. T-Aware allocates each task to the worker that maximizes the trust level, while minimizing the cost. We conduct extensive experiments to quantitatively evaluate the proposed algorithms in terms of running time, task failure ratio, trust and cost using a customer objective function on WorkflowSim, a well-known cloud simulation tool. Experimental results based on real-world workflows show that T-Aware outperforms other optimal solutions on finding the tradeoff between trust and cost, which is 3 to 6% better than the best competitor algorithm.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaa202","type":"journal-article","created":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T12:19:36Z","timestamp":1609503576000},"page":"929-940","source":"Crossref","is-referenced-by-count":5,"title":["Trust-aware Task Allocation in Collaborative Crowdsourcing Model"],"prefix":"10.1093","volume":"64","author":[{"given":"Fu","family":"Donglai","sequence":"first","affiliation":[{"name":"Software School, North University of China, Taiyuan 030051, Shanxi, China"},{"name":"Shanxi Province Military-Civilian Integration Software Engineering Technology Research Center, Taiyuan 030051, Shanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liu","family":"Yanhua","sequence":"additional","affiliation":[{"name":"Affiliated Hospital, North University of China, Taiyuan 030051, Shanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"key":"2021061711363090700_ref1","article-title":"Rapid assessment of disaster damage using social media activity","volume":"2","author":"Yury","year":"2016","journal-title":"Sci. Adv."},{"key":"2021061711363090700_ref2","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.chb.2018.10.028","article-title":"Mobile crowd sensing \u2013taxonomy, applications, challenges, and solutions","volume":"101","author":"Djallel","year":"2019","journal-title":"Comput. Hum. Behav."},{"key":"2021061711363090700_ref3","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1038\/526189a","article-title":"Crowdsourced research: Many hands make tight work","volume":"526","author":"Silberzahn","year":"2015","journal-title":"Nature"},{"key":"2021061711363090700_ref4","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1126\/science.1160379","article-title":"reCAPTCHA: Human-based character recognition via web security measures","volume":"321","author":"Ahn","year":"2008","journal-title":"Science"},{"key":"2021061711363090700_ref5","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/jeab.576","article-title":"Renewal and resurgence phenomena generalize to Amazon's Mechanical Turk","volume":"11","author":"Robinson","year":"2020","journal-title":"J. Exp. Anal. Behav."},{"key":"2021061711363090700_ref6","first-page":"1","article-title":"Fair task allocation in crowdsourced delivery","volume":"1","author":"Bas\u0131k","year":"2016","journal-title":"IEEE Transactions on Services Computing"},{"key":"2021061711363090700_ref7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1126\/science.aad6499","article-title":"The power of crowds","volume":"351","author":"Michelucci","year":"2016","journal-title":"Science"},{"key":"2021061711363090700_ref8","first-page":"4","article-title":"Man-computer Symbiosis. IEEE transactions on human factors in","volume":"1","author":"Licklider","year":"1960","journal-title":"Electronics"},{"key":"2021061711363090700_ref9","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.artint.2009.11.010","article-title":"From the semantic web to social machines: A research challenge for AI on the world wide web","volume":"174","author":"Hendler","year":"2010","journal-title":"Artificial Intelligence"},{"key":"2021061711363090700_ref10","first-page":"1","article-title":"The rise of crowd sourcing","volume":"14","author":"Howe","year":"2006","journal-title":"Wired Mag."},{"key":"2021061711363090700_ref11","first-page":"1003","volume-title":"Proceedings of the ACM Conference on Computer Supported Cooperative Work","author":"Kulkarni","year":"2012"},{"key":"2021061711363090700_ref12","first-page":"1801","author":"Kittur","year":"2011"},{"key":"2021061711363090700_ref13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1600150.1600159","volume-title":"Proceedings of the ACM SIGKDD Workshop on Human Computation","author":"Little","year":"2009"},{"key":"2021061711363090700_ref14","first-page":"57","article-title":"Turkit: Human computation algorithms on mechanical turk","author":"Little","year":"2010"},{"key":"2021061711363090700_ref15","first-page":"1168","author":"Dai","year":"2010"},{"key":"2021061711363090700_ref16","first-page":"87","volume-title":"26th AAAI, Canada, July","author":"Lin","year":"2012"},{"key":"2021061711363090700_ref17","first-page":"313","author":"Bernstein","year":"2010"},{"key":"2021061711363090700_ref18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-981-10-3996-6_2","volume-title":"Management of Information Process and Cooperation","author":"Zheng","year":"2017"},{"key":"2021061711363090700_ref19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/978-3-030-11641-5_31","volume-title":"Business Process Management Workshops","author":"Xiong","year":"2019"},{"key":"2021061711363090700_ref20","first-page":"37","volume-title":"Computer Supported Cooperative Work and Social Computing","author":"Shujie","year":"2018"},{"key":"2021061711363090700_ref21","first-page":"949","volume-title":"IEEE Int. Conf. Data Mining","author":"Rahman","year":"2015"},{"key":"2021061711363090700_ref22","volume-title":"Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence","author":"Ho","year":"2012"},{"key":"2021061711363090700_ref23","first-page":"297","author":"Khazankin","year":"2011"},{"key":"2021061711363090700_ref24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.2013.1235","article-title":"Budget-optimal task allocation for reliable crowdsourcing systems","volume":"62","author":"Karger","year":"2011","journal-title":"Oper. Res."},{"key":"2021061711363090700_ref25","first-page":"753","volume-title":"27th International Symposium on Parallel and Distributed Processing","author":"Boutsis","year":"2013"},{"key":"2021061711363090700_ref26","first-page":"1","volume-title":"34th International Conference on Distributed Computing Systems","author":"Boutsis","year":"2014"},{"key":"2021061711363090700_ref27","first-page":"443","volume-title":"8th International Conference on Collaborative Computing: Networking, Applications and Worksharing","author":"Khazankin","year":"2012"},{"key":"2021061711363090700_ref28","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1142\/S0218194019500268","article-title":"A novel approach to publishing tasks for collaboratively crowdsourcing workflows","volume":"29","author":"Wenjun","year":"2019","journal-title":"International Journal of Software Engineering and Knowledge Engineering"},{"key":"2021061711363090700_ref29","first-page":"1","article-title":"A crowdsourcing method for online social networks security assessment based on human-centric computing","volume":"10","author":"Zhang","year":"2020","journal-title":"HCIS"},{"key":"2021061711363090700_ref30","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1108\/OIR-09-2018-0269","article-title":"Marginality and team building in collaborative crowdsourcing","volume":"44","author":"Wang","year":"2020","journal-title":"Online Information Review"},{"key":"2021061711363090700_ref31","doi-asserted-by":"publisher","DOI":"10.1111\/radm.12429","article-title":"Determinants of idea sharing in crowdsourcing: Evidence from the automotive industry","author":"Thomas","year":"2020","journal-title":"R& D Management, online"},{"key":"2021061711363090700_ref32","first-page":"51","volume-title":"Proceedings of the 2012 Tenth Annual International Conference on Privacy, Security and Trust (PST)","author":"F","year":"2012"},{"key":"2021061711363090700_ref33","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1504\/IJGUC.2017.085915","article-title":"Combining reputation and QoS measures to improve cloud service composition","volume":"8","author":"Messina","year":"2017","journal-title":"Int. J. Grid and Utility Computing"},{"key":"2021061711363090700_ref34","first-page":"1","volume-title":"IEEE 8th International Conference on E-Science","author":"Chen","year":"2012"},{"key":"2021061711363090700_ref35","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.simpat.2018.10.004","article-title":"MOWS: Multi-objective workflow scheduling in cloud computing based on heuristic algorithm","volume":"93","author":"Farzaneh","year":"2019","journal-title":"Simulation Modelling Practice and Theory"},{"key":"2021061711363090700_ref36","first-page":"23","article-title":"Cloudsim: A toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms","volume":"41","author":"Calheiros","year":"2011","journal-title":"Software"},{"key":"2021061711363090700_ref37","doi-asserted-by":"crossref","first-page":"S65","DOI":"10.1785\/0120000510","article-title":"The scec southern California reference three-dimensional seismic velocity model version 2","volume":"90","author":"Magistrale","year":"2000","journal-title":"Bull. Seismol. Soc. Am."},{"key":"2021061711363090700_ref38","author":"Usc Epigenome Center"},{"key":"2021061711363090700_ref39","first-page":"1","volume-title":"Proceedings of the 2004 Earth Science Technology Conference","author":"Jacob","year":"2004"},{"key":"2021061711363090700_ref40","volume-title":"Workflows for e-Science","author":"Brown","year":"2007"},{"key":"2021061711363090700_ref41","doi-asserted-by":"crossref","first-page":"E3197","DOI":"10.1371\/journal.pone.0003197","article-title":"High-throughput, kingdom-wide prediction and annotation of bacterial non-coding rnas","volume":"3","author":"Livny","year":"2008","journal-title":"PLoS One"},{"key":"2021061711363090700_ref42","first-page":"1","volume-title":"Fifth AAAI Conference on Human Computation and Crowdsourcing","author":"Goel","year":"2017"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/6\/929\/38665368\/bxaa202.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/6\/929\/38665368\/bxaa202.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T11:37:16Z","timestamp":1623929836000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/64\/6\/929\/6146549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,22]]},"references-count":42,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2021,2,22]]},"published-print":{"date-parts":[[2021,6,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaa202","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2021,6]]},"published":{"date-parts":[[2021,2,22]]}}}