Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals

Efficient allocation of tasks to workers is a central problem in crowdsourcing. In this paper, we consider a special setting inspired from spatial crowdsourcing platforms where both workers and tasks arrive dynamically. Additionally, we assume all tasks are heterogeneous and each worker-task assignment brings a distinct reward. The natural challenge lies in how to incorporate the uncertainty in the arrivals from both workers and tasks into our online allocation policy such that the total expected rewards are maximized. To attack this challenge, we assume the arrival patterns of worker "types'' and task "types'' are not erratic and can be predicted from historical data. To be more specific, we consider a finite time horizon T and assume in each time-step, a single worker and task are sampled (i.e., "arrive'') from two respective distributions independently, and this sampling process repeats identically and independently for the entire T online time-steps. Our model, called Online Task Assignment with Two-Sided Arrival (OTA-TSA), is a significant generalization of the classical online task assignment where the set of tasks is assumed to be available offline. For the general version of OTA-TSA, we present an optimal non-adaptive algorithm which achieves an online competitive ratio of 0.295. For the special case of OTA-TSA where the reward is a function of just the worker type, we present an improved algorithm (which is adaptive) and achieves a competitive ratio of at least 0.343. On the hardness side, along with showing that the ratio obtained by our non-adaptive algorithm is the best possible among all non-adaptive algorithms, we further show that no (adaptive) algorithm can achieve a ratio better than $0.581 (unconditionally), even for the special case of OTA-TSA with homogenous tasks (i.e., all rewards are same). At the heart of our analysis lies a new technical tool (which is a refined notion of the birth-death process), called the two-stage birth-death process, which may be of independent interest. Finally, we perform numerical experiments on two real-world datasets obtained from crowdsourcing platforms to complement our theoretical results.

[1]  Aniket Kittur,et al.  Instrumenting the crowd: using implicit behavioral measures to predict task performance , 2011, UIST.

[2]  Aranyak Mehta,et al.  Online Matching and Ad Allocation , 2013, Found. Trends Theor. Comput. Sci..

[3]  Mausam,et al.  Parallel Task Routing for Crowdsourcing , 2014, HCOMP.

[4]  A. Subramanian,et al.  Online incentive mechanism design for smartphone crowd-sourcing , 2015, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[5]  Amin Saberi,et al.  Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.

[6]  Elliot Anshelevich,et al.  On the Social Welfare of Mechanisms for Repeated Batch Matching , 2012, AAAI.

[7]  Mausam,et al.  Joint Crowdsourcing of Multiple Tasks , 2013, HCOMP.

[8]  Yajun Wang,et al.  Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm , 2015, ICALP.

[9]  G. Goel,et al.  Matching Workers Expertise with Tasks : Incentives in Heterogeneous Crowdsourcing Markets ∗ , 2013 .

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

[11]  Lei Chen,et al.  Online Minimum Matching in Real-Time Spatial Data: Experiments and Analysis , 2016, Proc. VLDB Endow..

[12]  Morteza Zadimoghaddam,et al.  Online Stochastic Weighted Matching: Improved Approximation Algorithms , 2011, WINE.

[13]  Aranyak Mehta,et al.  Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Edward Curry,et al.  A Multi-armed Bandit Approach to Online Spatial Task Assignment , 2014, 2014 IEEE 11th Intl Conf on Ubiquitous Intelligence and Computing and 2014 IEEE 11th Intl Conf on Autonomic and Trusted Computing and 2014 IEEE 14th Intl Conf on Scalable Computing and Communications and Its Associated Workshops.

[15]  Patrick Jaillet,et al.  Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..

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

[17]  Lei Chen,et al.  gMission: A General Spatial Crowdsourcing Platform , 2014, Proc. VLDB Endow..

[18]  Xiaoying Gan,et al.  Incentivize crowd labeling under budget constraint , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[19]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[20]  Toby Walsh,et al.  Mechanisms for Online Organ Matching , 2017, IJCAI.

[21]  Andreas Krause,et al.  Truthful incentives in crowdsourcing tasks using regret minimization mechanisms , 2013, WWW.

[22]  Lei Chen,et al.  Online mobile Micro-Task Allocation in spatial crowdsourcing , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[23]  Gagan Goel,et al.  Allocating tasks to workers with matching constraints: truthful mechanisms for crowdsourcing markets , 2014, WWW.

[24]  Xiang-Yang Li,et al.  How to crowdsource tasks truthfully without sacrificing utility: Online incentive mechanisms with budget constraint , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[25]  Michal Feldman,et al.  Efficient parking allocation as online bipartite matching with posted prices , 2013, AAMAS.

[26]  Sepehr Assadi,et al.  Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets , 2015, HCOMP.

[27]  Itai Ashlagi,et al.  Kidney exchange in dynamic sparse heterogenous pools , 2013, EC '13.

[28]  Aravind Srinivasan,et al.  New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching , 2016, ESA.

[29]  Yaron Singer,et al.  Pricing Tasks in Online Labor Markets , 2011, Human Computation.

[30]  Jie Wu,et al.  Online Task Assignment for Crowdsensing in Predictable Mobile Social Networks , 2017, IEEE Transactions on Mobile Computing.

[31]  Xi Fang,et al.  Crowdsourcing to smartphones: incentive mechanism design for mobile phone sensing , 2012, Mobicom '12.

[32]  Yaron Singer,et al.  Pricing mechanisms for crowdsourcing markets , 2013, WWW.