资源论文Dynamic Task Allocation Algorithm for Hiring Workers that Learn

Dynamic Task Allocation Algorithm for Hiring Workers that Learn

2019-11-25 | |  41 |   42 |   0
Abstract The automation of hiring decisions is a well-studied topic in crowdsourcing. Existing hiring algorithms make a common assumption—that each worker has a level of task competence that is static and does not vary over time. In this work, we explore the question of how to hire workers who can learn over time. Using a medical time series classification task as a case study, we conducted experiments to show that workers’ performance does improve with experience and that it is possible to model and predict their learning rate. Furthermore, we propose a dynamic hiring mechanism that accounts for workers’ learning potential. Through both simulation and real-world crowdsourcing data, we show that our hiring procedure can lead to high-accuracy outcomes at lower cost compared to other mechanisms.

上一篇:Detecting Rumors from Microblogs with Recurrent Neural Networks

下一篇:WebGazer: Scalable Webcam Eye Tracking Using User Interactions

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...