Low Complexity Recruitment for Collaborative Mobile Crowdsourcing Using Graph Neural Networks

• URL: http://arxiv.org/abs/2106.00717v1
• Date: Tue, 1 Jun 2021 18:24:02 GMT
• Title: Low Complexity Recruitment for Collaborative Mobile Crowdsourcing Using Graph Neural Networks
• Authors: Aymen Hamrouni, Hakim Ghazzai, Turki Alelyani, Yehia Massoud
• Abstract summary: Collaborative Mobile crowdsourcing (CMCS) allows entities, e.g., local authorities or individuals, to hire a team of workers from the crowd of connected people. We investigate two different CMCS recruitment strategies allowing task requesters to form teams of socially connected and skilled workers.
• Score: 2.798697306330988
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Collaborative Mobile crowdsourcing (CMCS) allows entities, e.g., local authorities or individuals, to hire a team of workers from the crowd of connected people, to execute complex tasks. In this paper, we investigate two different CMCS recruitment strategies allowing task requesters to form teams of socially connected and skilled workers: i) a platform-based strategy where the platform exploits its own knowledge about the workers to form a team and ii) a leader-based strategy where the platform designates a group leader that recruits its own suitable team given its own knowledge about its Social Network (SN) neighbors. We first formulate the recruitment as an Integer Linear Program (ILP) that optimally forms teams according to four fuzzy-logic-based criteria: level of expertise, social relationship strength, recruitment cost, and recruiter's confidence level. To cope with NP-hardness, we design a novel low-complexity CMCS recruitment approach relying on Graph Neural Networks (GNNs), specifically graph embedding and clustering techniques, to shrink the workers' search space and afterwards, exploiting a meta-heuristic genetic algorithm to select appropriate workers. Simulation results applied on a real-world dataset illustrate the performance of both proposed CMCS recruitment approaches. It is shown that our proposed low-complexity GNN-based recruitment algorithm achieves close performances to those of the baseline ILP with significant computational time saving and ability to operate on large-scale mobile crowdsourcing platforms. It is also shown that compared to the leader-based strategy, the platform-based strategy recruits a more skilled team but with lower SN relationships and higher cost.

Related papers

• Enhancing Worker Recruitment in Collaborative Mobile Crowdsourcing: A Graph Neural Network Trust Evaluation Approach [7.883218966932225]
  Collaborative Mobile Crowdsourcing (CMCS) allows platforms to recruit worker teams to collaboratively execute complex sensing tasks. To obtain the asymmetric trust values among all workers in the social network, the Trust Reinforcement Evaluation Framework (TREF) is proposed in this paper.
  arXiv  Detail & Related papers  (2023-06-07T11:59:45Z)
• A Reinforcement Learning-assisted Genetic Programming Algorithm for Team Formation Problem Considering Person-Job Matching [70.28786574064694]
  A reinforcement learning-assisted genetic programming algorithm (RL-GP) is proposed to enhance the quality of solutions. The hyper-heuristic rules obtained through efficient learning can be utilized as decision-making aids when forming project teams.
  arXiv  Detail & Related papers  (2023-04-08T14:32:12Z)
• MARLIN: Soft Actor-Critic based Reinforcement Learning for Congestion Control in Real Networks [63.24965775030673]
  We propose a novel Reinforcement Learning (RL) approach to design generic Congestion Control (CC) algorithms. Our solution, MARLIN, uses the Soft Actor-Critic algorithm to maximize both entropy and return. We trained MARLIN on a real network with varying background traffic patterns to overcome the sim-to-real mismatch.
  arXiv  Detail & Related papers  (2023-02-02T18:27:20Z)
• GENIUS: A Novel Solution for Subteam Replacement with Clustering-based Graph Neural Network [34.510076775330795]
  Subteam replacement is defined as finding the optimal candidate set of people who can best function as an unavailable subset of members. We propose GENIUS, a novel clustering-based graph neural network (GNN) framework that can capture team network knowledge for flexible subteam replacement.
  arXiv  Detail & Related papers  (2022-11-08T09:02:59Z)
• Ranking-based Group Identification via Factorized Attention on Social Tripartite Graph [68.08590487960475]
  We propose a novel GNN-based framework named Contextualized Factorized Attention for Group identification (CFAG) We devise tripartite graph convolution layers to aggregate information from different types of neighborhoods among users, groups, and items. To cope with the data sparsity issue, we devise a novel propagation augmentation layer, which is based on our proposed factorized attention mechanism.
  arXiv  Detail & Related papers  (2022-11-02T01:42:20Z)
• Learning Connectivity-Maximizing Network Configurations [123.01665966032014]
  We propose a supervised learning approach with a convolutional neural network (CNN) that learns to place communication agents from an expert. We demonstrate the performance of our CNN on canonical line and ring topologies, 105k randomly generated test cases, and larger teams not seen during training. After training, our system produces connected configurations 2 orders of magnitude faster than the optimization-based scheme for teams of 10-20 agents.
  arXiv  Detail & Related papers  (2021-12-14T18:59:01Z)
• Learning Connectivity for Data Distribution in Robot Teams [96.39864514115136]
  We propose a task-agnostic, decentralized, low-latency method for data distribution in ad-hoc networks using Graph Neural Networks (GNN) Our approach enables multi-agent algorithms based on global state information to function by ensuring it is available at each robot. We train the distributed GNN communication policies via reinforcement learning using the average Age of Information as the reward function and show that it improves training stability compared to task-specific reward functions.
  arXiv  Detail & Related papers  (2021-03-08T21:48:55Z)
• Decentralized Reinforcement Learning: Global Decision-Making via Local Economic Transactions [80.49176924360499]
  We establish a framework for directing a society of simple, specialized, self-interested agents to solve sequential decision problems. We derive a class of decentralized reinforcement learning algorithms. We demonstrate the potential advantages of a society's inherent modular structure for more efficient transfer learning.
  arXiv  Detail & Related papers  (2020-07-05T16:41:09Z)
• A Stochastic Team Formation Approach for Collaborative Mobile Crowdsourcing [1.4209473797379666]
  We develop an algorithm that exploit workers knowledge about their SN neighbors and asks a designated leader to recruit a suitable team. The proposed algorithm is inspired from the optimal stopping strategies and uses the odds-algorithm to compute its output. Experimental results show that, compared to the benchmark exponential optimal solution, the proposed approach reduces time and produces reasonable performance results.
  arXiv  Detail & Related papers  (2020-04-28T22:44:37Z)
• Optimal Team Recruitment Strategies for Collaborative Mobile Crowdsourcing Systems [1.4209473797379666]
  We develop two recruitment strategies for collaborative Mobile Crowdsourcing frameworks. The first proposed strategy is a platform-based approach which exploits the platform knowledge to form the team. The second one is a leader-based approach that uses team members' knowledge about their social network (SN) neighbors to designate a group leader that recruits its suitable team.
  arXiv  Detail & Related papers  (2020-04-24T02:38:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.