{"title":"WSC:众力驱动的可分解复杂任务与工人集映射框架","authors":"Suneel Kumar, Sarvesh Pandey","doi":"10.1002/cpe.8305","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>The crowdsourcing platform serves as an intermediary managing the interaction between a requester who posts a decomposable task and a pool of workers who bid to solve it. Each worker intending to take up the task (partially or fully) decomposes it into multiple independent subtasks and submits it to the platform. Selection of a diverse set of workers (based on the bids received) to solve the decomposable task is challenging as it requires balancing factors like cost and quality while encouraging collaboration. We propose a Worker Set Computation (WSC) methodology to address these challenges by selecting a custom set of potential workers who can collaboratively complete the task with the optimal cost, in an efficient way. The aging technique is employed to dynamically update the weight of each worker, giving more weightage to the feedback received in the recent past. This, in turn, not only favors those workers who were rated well in the immediate past but also ensures that one odd feedback does not influence the overall rating heavily. We compare the performance of the proposed method against the state-of-the-art methods, considering the computational (and budget) requirements, as well as the aging-based worker rating.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"WSC: A Crowd-Powered Framework for Mapping Decomposable Complex-Task With Worker-Set\",\"authors\":\"Suneel Kumar, Sarvesh Pandey\",\"doi\":\"10.1002/cpe.8305\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>The crowdsourcing platform serves as an intermediary managing the interaction between a requester who posts a decomposable task and a pool of workers who bid to solve it. Each worker intending to take up the task (partially or fully) decomposes it into multiple independent subtasks and submits it to the platform. Selection of a diverse set of workers (based on the bids received) to solve the decomposable task is challenging as it requires balancing factors like cost and quality while encouraging collaboration. We propose a Worker Set Computation (WSC) methodology to address these challenges by selecting a custom set of potential workers who can collaboratively complete the task with the optimal cost, in an efficient way. The aging technique is employed to dynamically update the weight of each worker, giving more weightage to the feedback received in the recent past. This, in turn, not only favors those workers who were rated well in the immediate past but also ensures that one odd feedback does not influence the overall rating heavily. We compare the performance of the proposed method against the state-of-the-art methods, considering the computational (and budget) requirements, as well as the aging-based worker rating.</p>\\n </div>\",\"PeriodicalId\":55214,\"journal\":{\"name\":\"Concurrency and Computation-Practice & Experience\",\"volume\":\"36 28\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2024-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Concurrency and Computation-Practice & Experience\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8305\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8305","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
WSC: A Crowd-Powered Framework for Mapping Decomposable Complex-Task With Worker-Set
The crowdsourcing platform serves as an intermediary managing the interaction between a requester who posts a decomposable task and a pool of workers who bid to solve it. Each worker intending to take up the task (partially or fully) decomposes it into multiple independent subtasks and submits it to the platform. Selection of a diverse set of workers (based on the bids received) to solve the decomposable task is challenging as it requires balancing factors like cost and quality while encouraging collaboration. We propose a Worker Set Computation (WSC) methodology to address these challenges by selecting a custom set of potential workers who can collaboratively complete the task with the optimal cost, in an efficient way. The aging technique is employed to dynamically update the weight of each worker, giving more weightage to the feedback received in the recent past. This, in turn, not only favors those workers who were rated well in the immediate past but also ensures that one odd feedback does not influence the overall rating heavily. We compare the performance of the proposed method against the state-of-the-art methods, considering the computational (and budget) requirements, as well as the aging-based worker rating.
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.