Concurrent Team Formation for Multiple Tasks in Crowdsourcing Platform

The tremendous growth of social media technologies has inspired research communities as well as industries to extend the horizon of organizations by recruiting workers available on freelancing sites. Most of the tasks usually require expertise of workers from diverse domains, thus the problem can be reduced to that of team formation. In this work, we address the problem of assigning workers to tasks, where each task requires a set of skills and thus may require more than one worker to successfully complete the task. Given a set of tasks, and a set of workers each with a cost, the objective is to find mutually exclusive set of workers for each task, who can accomplish the task in the most cost-effective manner. The problem being NP-hard, we propose an approximation algorithm that attempts to find the best fit workers based on their collective intelligence for a single task. This approach selects workers in a manner that their expertise complements each other, hence maintaining a balance among the required skills. Such balanced assignment sets require lesser number of workers and reduce the overall cost. The approach is then extended to a set of N tasks. We show that the solution is (2+ α) approximate. The proposed algorithm is evaluated against different assignment schemes. Experimental results using real data show that our approach performs well.

[1]  Davide Martinenghi,et al.  A workload-dependent task assignment policy for crowdsourcing , 2017, World Wide Web.

[2]  D. Meyer,et al.  Supporting Online Material Materials and Methods Som Text Figs. S1 to S6 References Evidence for a Collective Intelligence Factor in the Performance of Human Groups , 2022 .

[3]  Dror Rawitz,et al.  Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004 , 2004, CSUR.

[4]  Sihem Amer-Yahia,et al.  Worker Skill Estimation in Team-Based Tasks , 2015, Proc. VLDB Endow..

[5]  Jiming Chen,et al.  Toward optimal allocation of location dependent tasks in crowdsensing , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[6]  Theodoros Lappas,et al.  Profit-maximizing cluster hires , 2014, KDD.

[7]  Victor C. M. Leung,et al.  Vita: A Crowdsensing-Oriented Mobile Cyber-Physical System , 2013, IEEE Transactions on Emerging Topics in Computing.

[8]  Gianluca Demartini,et al.  Pick-a-crowd: tell me what you like, and i'll tell you what to do , 2013, CIDR.

[9]  Akash Yadav,et al.  Efficient user assignment in crowd sourcing applications , 2016, 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI).

[10]  Chien-Ju Ho,et al.  Online Task Assignment in Crowdsourcing Markets , 2012, AAAI.

[11]  Teodor Gabriel Crainic,et al.  The Generalized Bin Packing Problem , 2012 .

[12]  Mauro Maria Baldi,et al.  On the generalized bin packing problem , 2017, Int. Trans. Oper. Res..

[13]  Michael Vitale,et al.  The Wisdom of Crowds , 2015, Cell.

[14]  Iulia Maries,et al.  A Genetic Algorithm for Community Formation based on Collective Intelligence Capacity , 2011, KES-AMSTA.

[15]  Gaganmeet Kaur Awal,et al.  Team formation in social networks based on collective intelligence – an evolutionary approach , 2014, Applied Intelligence.

[16]  Theodoros Lappas,et al.  Finding a team of experts in social networks , 2009, KDD.

[17]  Richard E. Korf,et al.  Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems , 2011, J. Artif. Intell. Res..