Matchmaker: Stable Task Assignment With Bounded Constraints for Crowdsourcing Platforms

摘要

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.