Task assignment with guaranteed quality for crowdsourcing platforms

Xiaoyan Yin, Yanjiao Chen, Baochun Li
{"title":"Task assignment with guaranteed quality for crowdsourcing platforms","authors":"Xiaoyan Yin, Yanjiao Chen, Baochun Li","doi":"10.1109/IWQoS.2017.7969165","DOIUrl":null,"url":null,"abstract":"Crowdsourcing leverages the collective intelligence of the massive crowd workers to accomplish tasks in a cost-effective way. On a crowdsourcing platform, it is challenging to assign tasks to workers in an appropriate way due to heterogeneity in both tasks and workers. In this paper, we explore the problem of assigning workers with various skill levels to tasks with different quality requirements and budget constraints. We first formulate the task assignment as a many-to-one matching problem, in which multiple workers are assigned to a task, and the task can be successfully completed only if a minimum quality requirement can be satisfied within its limited budget. Different from traditional task assignment mechanisms which focus on utility maximization for the crowdsourcing platform, our proposed matching framework takes into consideration the preferences of individual crowdsourcers and workers towards each other. We design a novel algorithm that can generate a stable outcome for the many-to-one matching problem with lower and upper bounds (i.e., quality requirement and budget constraint), as well as heterogeneous worker skill levels. Through extensive simulations, we show that the proposed algorithm can greatly improve the success ratio of task accomplishment and worker happiness, when compared with existing algorithms.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQoS.2017.7969165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

Abstract

Crowdsourcing leverages the collective intelligence of the massive crowd workers to accomplish tasks in a cost-effective way. On a crowdsourcing platform, it is challenging to assign tasks to workers in an appropriate way due to heterogeneity in both tasks and workers. In this paper, we explore the problem of assigning workers with various skill levels to tasks with different quality requirements and budget constraints. We first formulate the task assignment as a many-to-one matching problem, in which multiple workers are assigned to a task, and the task can be successfully completed only if a minimum quality requirement can be satisfied within its limited budget. Different from traditional task assignment mechanisms which focus on utility maximization for the crowdsourcing platform, our proposed matching framework takes into consideration the preferences of individual crowdsourcers and workers towards each other. We design a novel algorithm that can generate a stable outcome for the many-to-one matching problem with lower and upper bounds (i.e., quality requirement and budget constraint), as well as heterogeneous worker skill levels. Through extensive simulations, we show that the proposed algorithm can greatly improve the success ratio of task accomplishment and worker happiness, when compared with existing algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
众包平台有质量保证的任务分配
众包是利用大量人群工作者的集体智慧,以经济高效的方式完成任务。在众包平台上,由于任务和工人的异质性,以适当的方式分配任务是具有挑战性的。在本文中,我们探讨了分配不同技能水平的工人到具有不同质量要求和预算约束的任务的问题。我们首先将任务分配表述为多对一匹配问题,即将多个工人分配到一个任务中,并且只有在有限的预算范围内满足最低质量要求才能成功完成任务。与传统的任务分配机制关注众包平台的效用最大化不同,我们提出的匹配框架考虑了个体众包者和劳动者对彼此的偏好。我们设计了一种新的算法,该算法可以为具有下界和上界(即质量要求和预算约束)以及异构工人技能水平的多对一匹配问题生成稳定的结果。通过大量的仿真,我们表明,与现有算法相比,所提出的算法可以大大提高任务完成的成功率和工人的幸福感。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
When privacy meets economics: Enabling differentially-private battery-supported meter reporting in smart grid Task assignment with guaranteed quality for crowdsourcing platforms Social media stickiness in Mobile Personal Livestreaming service Multicast scheduling algorithm in software defined fat-tree data center networks A cooperative mechanism for efficient inter-domain in-network cache sharing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1