Pith. sign in

REVIEW

A Stochastic Team Formation Approach for Collaborative Mobile Crowdsourcing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.13881 v1 pith:IAZFACAP submitted 2020-04-28 cs.CY cs.CC

A Stochastic Team Formation Approach for Collaborative Mobile Crowdsourcing

classification cs.CY cs.CC
keywords teamapproachcmcscrowdsourcingformationonlytasksworkers
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Mobile Crowdsourcing (MCS) is the generalized act of outsourcing sensing tasks, traditionally performed by employees or contractors, to a large group of smart-phone users by means of an open call. With the increasing complexity of the crowdsourcing applications, requesters find it essential to harness the power of collaboration among the workers by forming teams of skilled workers satisfying their complex tasks' requirements. This type of MCS is called Collaborative MCS (CMCS). Previous CMCS approaches have mainly focused only on the aspect of team skills maximization. Other team formation studies on social networks (SNs) have only focused on social relationship maximization. In this paper, we present a hybrid approach where requesters are able to hire a team that, not only has the required expertise, but also is socially connected and can accomplish tasks collaboratively. Because team formation in CMCS is proven to be NP-hard, we develop a stochastic 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 computation time and produces reasonable performance results.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.