How to crowdsource tasks truthfully without sacrificing utility: Online incentive mechanisms with budget constraint

Mobile crowdsourced sensing (MCS) is a new paradigm which takes advantage of pervasive smartphones to efficiently collect data, enabling numerous novel applications. To achieve good service quality for a MCS application, incentive mechanisms are necessary to attract more user participation. Most of existing mechanisms apply only for the offline scenario where all users' information are known a priori. On the contrary, we focus on a more realistic scenario where users arrive one by one online in a random order. Based on the online auction model, we investigate the problem that users submit their private types to the crowdsourcer when arrive, and the crowdsourcer aims at selecting a subset of users before a specified deadline for maximizing the value of services (assumed to be a non-negative monotone submodular function) provided by selected users under a budget constraint. We design two online mechanisms, OMZ and OMG, satisfying the computational efficiency, individual rationality, budget feasibility, truthfulness, consumer sovereignty and constant competitiveness under the zero arrival-departure interval case and a more general case, respectively. Through extensive simulations, we evaluate the performance and validate the theoretical properties of our online mechanisms.

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

[2]  Shaojie Tang,et al.  Efficient and Strategyproof Spectrum Allocations in Multichannel Wireless Networks , 2011, IEEE Transactions on Computers.

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

[4]  Jian Tang,et al.  Energy-efficient collaborative sensing with mobile phones , 2012, 2012 Proceedings IEEE INFOCOM.

[5]  Emiliano Miluzzo,et al.  A survey of mobile phone sensing , 2010, IEEE Communications Magazine.

[6]  Jean C. Walrand,et al.  Incentive mechanisms for smartphone collaboration in data acquisition and distributed computing , 2012, 2012 Proceedings IEEE INFOCOM.

[7]  Morteza Zadimoghaddam,et al.  Submodular secretary problem and extensions , 2013, TALG.

[8]  Demetrios Zeinalipour-Yazti,et al.  Crowdsourcing with Smartphones , 2012, IEEE Internet Computing.

[9]  Liang Liu,et al.  On Opportunistic Coverage for Urban Sensing , 2013, 2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems.

[10]  George Danezis,et al.  How Much Is Location Privacy Worth? , 2005, WEIS.

[11]  Margaret Martonosi,et al.  SignalGuru: leveraging mobile phones for collaborative traffic signal schedule advisory , 2011, MobiSys '11.

[12]  Xiang-Yang Li,et al.  OMG: How Much Should I Pay Bob in Truthful Online Mobile Crowdsourced Sensing? , 2013, ArXiv.

[13]  Robert D. Kleinberg,et al.  Learning on a budget: posted price mechanisms for online procurement , 2012, EC '12.

[14]  Anna R. Karlin,et al.  Competitive auctions , 2006, Games Econ. Behav..

[15]  Nicole Immorlica,et al.  Online auctions and generalized secretary problems , 2008, SECO.

[16]  Xiang-Yang Li,et al.  TOFU: Semi-Truthful Online Frequency Allocation Mechanism for Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[17]  Felix Wu,et al.  Incentive-compatible online auctions for digital goods , 2002, SODA '02.

[18]  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).

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

[20]  Ramachandran Ramjee,et al.  Nericell: rich monitoring of road and traffic conditions using mobile smartphones , 2008, SenSys '08.

[21]  Mohammad Taghi Hajiaghayi,et al.  Adaptive limited-supply online auctions , 2004, EC '04.

[22]  Shaojie Tang,et al.  Mechanism Design for Finding Experts Using Locally Constructed Social Referral Web , 2015, IEEE Transactions on Parallel and Distributed Systems.

[23]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[24]  Shaojie Tang,et al.  COUPON: Cooperatively Building Sensing Maps in Mobile Opportunistic Networks , 2013, 2013 IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems.

[25]  Wen Hu,et al.  Ear-phone: an end-to-end participatory urban noise mapping system , 2010, IPSN '10.

[26]  Sivan Toledo,et al.  VTrack: accurate, energy-aware road traffic delay estimation using mobile phones , 2009, SenSys '09.

[27]  Ellie D'Hondt,et al.  Crowdsourcing of Pollution Data using Smartphones , 2010 .

[28]  Fan Ye,et al.  Mobile crowdsensing: current state and future challenges , 2011, IEEE Communications Magazine.

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

[30]  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.