Riya Samanta, Vaibhav Saxena, S. Ghosh, Sajal K. Das
{"title":"基于自适应公共工作时段的协同众包志愿者选择","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":"{\"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}","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}
Volunteer Selection in Collaborative Crowdsourcing with Adaptive Common Working Time Slots
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.