.png){kind=icon}
返回
Matchmaker: Stable Task Assignment With Bounded Constraints for Crowdsourcing Platforms
.png){kind=icon}
PRE
AI
DOI：10.1109/JIOT.2020.3014440.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Crowdsourcing has become a popular paradigm to leverage the collective intelligence of massive crowd workers to perform certain tasks in a cost-effective way. Task assignment is an essential issue in crowdsourcing platforms owing to heterogeneous tasks and work skills. In this article, we focus on assigning workers with diversified skill levels to crowdsourcing tasks with different quality requirements and budget constraints. Task assignment is fundamentally a many-to-one matching problem, where one task is allocated to multiple users who can meet the minimum quality requirement of the task within the limited budget. While most existing works try to maximize the utility of the crowdsourcing platform, we take into account the individual preferences of crowdsourcers and workers toward each other to ensure the stability of task assignment results. In this article, we propose task assignment mechanisms that can guarantee stable outcomes for the many-to-one matching problem with lower and upper bounds (i.e., quality requirement and budget constraint) in regard to heterogeneous worker skill levels. Extensive simulation results show that the proposed algorithms can greatly improve the success ratio of task accomplishment and worker happiness compared with existing algorithms.
Keyword:
Task analysis
Crowdsourcing
Upper bound
Internet of Things
Stability analysis
Simulation
Crowdsourcing
matching
quality requirement
task assignment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
1.4W
被引数:
7.8W
机构
引用论文
.png){kind=icon}
Optimal Selection of Crowdsourcing Workers Balancing Their Utilities and Platform Profit兼顾效用与平台利润的众包工作者优化选择
PREAI
分享收藏An Approximation Algorithm for Bounded Task Assignment Problem in Spatial Crowdsourcing空间众包中有界任务分配问题的近似算法
PREAI
分享收藏
查看更多内容