Incentivize Multi-Class Crowd Labeling Under Budget Constraint

Crowdsourcing systems allocate tasks to a group of workers over the Internet, which have become an effective paradigm for human-powered problem solving, such as image classification, optical character recognition, and proofreading. In this paper, we focus on incentivizing crowd workers to label a set of multi-class labeling tasks under strict budget constraint. We properly profile the tasks’ difficulty levels and workers’ quality in crowdsourcing systems, where the collected labels are aggregated with sequential Bayesian approach. To stimulate workers to undertake crowd labeling tasks, the interaction between workers and the platform is modeled as a reverse auction. We reveal that the platform utility maximization could be intractable, for which an incentive mechanism that determines the winning bid and payments with polynomial-time computation complexity is developed. Moreover, we theoretically prove that our mechanism is truthful, individually rational, and budget feasible. Through extensive simulations, we demonstrate that our mechanism utilizes budget efficiently to achieve high platform utility with polynomial computation complexity.

[1]  Shipeng Yu,et al.  Ranking annotators for crowdsourced labeling tasks , 2011, NIPS.

[2]  R. Aumann Backward induction and common knowledge of rationality , 1995 .

[3]  Miguel A. Labrador,et al.  A location-based incentive mechanism for participatory sensing systems with budget constraints , 2012, 2012 IEEE International Conference on Pervasive Computing and Communications.

[4]  Baik Hoh,et al.  Sell your experiences: a market mechanism based incentive for participatory sensing , 2010, 2010 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[5]  M. Abramowitz,et al.  Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .

[6]  Yaron Singer,et al.  Budget Feasible Mechanisms , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[7]  Xiaoying Gan,et al.  Cooperative Spectrum Sharing in Cognitive Radio Networks: A Distributed Matching Approach , 2014, IEEE Transactions on Communications.

[8]  Devavrat Shah,et al.  Iterative Learning for Reliable Crowdsourcing Systems , 2011, NIPS.

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

[10]  Gerardo Hermosillo,et al.  Learning From Crowds , 2010, J. Mach. Learn. Res..

[11]  Luis von Ahn Games with a Purpose , 2006, Computer.

[12]  Jean C. Walrand,et al.  Motivating Smartphone Collaboration in Data Acquisition and Distributed Computing , 2014, IEEE Transactions on Mobile Computing.

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

[14]  Xi Chen,et al.  Optimistic Knowledge Gradient Policy for Optimal Budget Allocation in Crowdsourcing , 2013, ICML.

[15]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

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

[17]  Devavrat Shah,et al.  Efficient crowdsourcing for multi-class labeling , 2013, SIGMETRICS '13.

[18]  Mihaela van der Schaar,et al.  Reputation-based incentive protocols in crowdsourcing applications , 2011, 2012 Proceedings IEEE INFOCOM.

[19]  Athanasios V. Vasilakos,et al.  TRAC: Truthful auction for location-aware collaborative sensing in mobile crowdsourcing , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[20]  David C. Parkes,et al.  Designing incentives for online question and answer forums , 2009, EC '09.