Volunteer Selection in Collaborative Crowdsourcing with Adaptive Common Working Time Slots

Riya Samanta, Vaibhav Saxena, S. Ghosh, Sajal K. Das
{"title":"Volunteer Selection in Collaborative Crowdsourcing with Adaptive Common Working Time Slots","authors":"Riya Samanta, Vaibhav Saxena, S. Ghosh, Sajal K. Das","doi":"10.1109/GLOBECOM48099.2022.10001191","DOIUrl":null,"url":null,"abstract":"Skill-based volunteering is an expanding branch of crowdsourcing where one may acquire sustainable services, solutions, and ideas from the crowd by connecting with them online. The optimal mapping between volunteers and tasks with collaboration becomes challenging for complex tasks demanding greater skills and cognitive ability. Unlike traditional crowdsourcing, volunteers like to work on their own schedule and locations. To address this problem, we propose a novel two-phase frame-work consisting of Initial Volunteer-Task Mapping (i-VTM) and Adaptive Common Slot Finding (a-CSF) algorithms. The i-VTM algorithm assigns volunteers to the tasks based on their skills and spatial proximity, whereas the a-CSF algorithm recommends appropriate common working time slots for successful volunteer collaboration. Both the algorithms aim to maximise the overall utility of the crowdsourcing platform. Experimenting with the UpWork dataset demonstrates the efficacy of our framework over existing state-of-the-art methods.","PeriodicalId":313199,"journal":{"name":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM48099.2022.10001191","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Skill-based volunteering is an expanding branch of crowdsourcing where one may acquire sustainable services, solutions, and ideas from the crowd by connecting with them online. The optimal mapping between volunteers and tasks with collaboration becomes challenging for complex tasks demanding greater skills and cognitive ability. Unlike traditional crowdsourcing, volunteers like to work on their own schedule and locations. To address this problem, we propose a novel two-phase frame-work consisting of Initial Volunteer-Task Mapping (i-VTM) and Adaptive Common Slot Finding (a-CSF) algorithms. The i-VTM algorithm assigns volunteers to the tasks based on their skills and spatial proximity, whereas the a-CSF algorithm recommends appropriate common working time slots for successful volunteer collaboration. Both the algorithms aim to maximise the overall utility of the crowdsourcing platform. Experimenting with the UpWork dataset demonstrates the efficacy of our framework over existing state-of-the-art methods.
基于自适应公共工作时段的协同众包志愿者选择
基于技能的志愿服务是众包的一个不断扩大的分支,人们可以通过在线与人群联系,从他们那里获得可持续的服务、解决方案和想法。对于需要更高技能和认知能力的复杂任务,志愿者和协作任务之间的最佳映射变得具有挑战性。与传统的众包不同,志愿者喜欢按照自己的时间表和地点工作。为了解决这个问题,我们提出了一个新的两阶段框架,包括初始志愿者任务映射(i-VTM)和自适应公共槽查找(a- csf)算法。i-VTM算法根据志愿者的技能和空间接近度为志愿者分配任务,而a-CSF算法则为志愿者的成功合作推荐合适的公共工作时间段。这两种算法都旨在最大化众包平台的整体效用。UpWork数据集的实验证明了我们的框架优于现有的最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信