Adaptive Selection of Working Conditions for Crowdsourced Tasks

Shohei Yamamoto, S. Matsubara
{"title":"Adaptive Selection of Working Conditions for Crowdsourced Tasks","authors":"Shohei Yamamoto, S. Matsubara","doi":"10.1109/AGENTS.2018.8460133","DOIUrl":null,"url":null,"abstract":"This paper proposes a method of working condition selection based on type identification of crowd workers. Here, the working condition selection means finding the values of working conditions that are suitable for individual workers. Multi-armed bandit techniques are promising, but it may happen that exploring various task settings for a single worker interferes with that worker, which deteriorates the quality of contributions. To solve this problem, we introduce the type identification test, i.e., we divide the entire period for a worker into a type identification phase and an execution phase and alternately handle the calculation at the individual level and at the aggregate level. Our method can find an appropriate task setting without exploring various settings for a worker, i.e., excessively interfering with the worker. Also, we provide a method of calculating the optimal type identification test to maximize the expected quality of contributions in the execution phase. Finally, we show our method outperforms conventional multi-armed bandit algorithms such as Softmax and UCB1 with data we collected on the Amazon Mechanical Turk and with a simulation.","PeriodicalId":248901,"journal":{"name":"2018 IEEE International Conference on Agents (ICA)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Agents (ICA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AGENTS.2018.8460133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a method of working condition selection based on type identification of crowd workers. Here, the working condition selection means finding the values of working conditions that are suitable for individual workers. Multi-armed bandit techniques are promising, but it may happen that exploring various task settings for a single worker interferes with that worker, which deteriorates the quality of contributions. To solve this problem, we introduce the type identification test, i.e., we divide the entire period for a worker into a type identification phase and an execution phase and alternately handle the calculation at the individual level and at the aggregate level. Our method can find an appropriate task setting without exploring various settings for a worker, i.e., excessively interfering with the worker. Also, we provide a method of calculating the optimal type identification test to maximize the expected quality of contributions in the execution phase. Finally, we show our method outperforms conventional multi-armed bandit algorithms such as Softmax and UCB1 with data we collected on the Amazon Mechanical Turk and with a simulation.
众包任务工作条件的自适应选择
提出了一种基于群体工人类型识别的工况选择方法。在这里,工作条件选择意味着找到适合个体工人的工作条件值。多武装强盗技术是很有前途的,但是为单个工人探索各种任务设置可能会干扰该工人,从而降低贡献的质量。为了解决这个问题,我们引入了类型识别测试,即我们将一个工人的整个周期划分为类型识别阶段和执行阶段,并交替地在个人层面和聚合层面处理计算。我们的方法可以找到一个合适的任务设置,而不需要为一个worker探索各种设置,即过度干扰worker。此外,我们还提供了一种计算最佳类型识别测试的方法,以在执行阶段最大化贡献的预期质量。最后,我们通过在亚马逊土耳其机器人上收集的数据和模拟表明,我们的方法优于传统的多臂强盗算法,如Softmax和UCB1。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信