Posted pricing for robust crowdsensing

Mobile crowdsensing has been considered as a promising approach for large scale urban data collection, but has also posed new challenging problems such as incentivization and quality control. Among the other incentivization approaches, posted pricing has been widely adopted by commercial systems due to the reason that it naturally achieves truthfulness and fairness and is easy to be implemented. However, the fundamental problem of how to set a right posted price in crowdsensing systems remains largely open. In this paper, we study a quality-aware Bayesian pricing problem for mobile crowdsensing where the users' sensing costs and qualities for participating in crowdsensing are drawn from known distributions learned from historical information, and our goal is to choose an appropriate posted price to recruit a group of participants with reasonable sensing qualities for robust crowdsensing, while the total expected payment is minimized. We show that our problem is NP-hard and has close ties with the well known Poisson Binomial Distributions (PBD). To solve our problem, we first discover some non-trivial submodular properties of PBD, which have not been reported before, then we propose a novel "ironing method" that transforms our problem from a non-submodular optimization problem into a submodular one by leveraging the newly discovered properties of PBD. Finally, with the ironing method, an approximate algorithm with provable performance ratio is provided, and we also conduct extensive numerical simulations to demonstrate the effectiveness of our approach.

[1]  Eric Balkanski,et al.  Bayesian Budget Feasibility with Posted Pricing , 2015, WWW.

[2]  Ting Wu,et al.  Hear the Whole Story: Towards the Diversity of Opinion in Crowdsourcing Markets , 2015, Proc. VLDB Endow..

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

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

[5]  Amos Fiat,et al.  Revenue maximizing envy-free multi-unit auctions with budgets , 2012, EC '12.

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

[7]  Milan Vojnovic,et al.  Crowdsourcing and all-pay auctions , 2009, EC '09.

[8]  Marco Ajmone Marsan,et al.  The importance of being earnest in crowdsourcing systems , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[9]  Pushmeet Kohli,et al.  Tractability: Practical Approaches to Hard Problems , 2013 .

[10]  Hwee Pink Tan,et al.  Profit-maximizing incentive for participatory sensing , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[11]  Chi Zhang,et al.  Truthful Scheduling Mechanisms for Powering Mobile Crowdsensing , 2013, IEEE Transactions on Computers.

[12]  Jian Tang,et al.  Truthful incentive mechanisms for crowdsourcing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[13]  Ruggiero Cavallo,et al.  Efficient crowdsourcing contests , 2012, AAMAS.

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

[15]  Panos M. Pardalos,et al.  Greedy approximations for minimum submodular cover with submodular cost , 2010, Comput. Optim. Appl..

[16]  Lance Kaplan,et al.  On truth discovery in social sensing: A maximum likelihood estimation approach , 2012, 2012 ACM/IEEE 11th International Conference on Information Processing in Sensor Networks (IPSN).

[17]  Rocco A. Servedio,et al.  Learning Poisson Binomial Distributions , 2011, STOC '12.

[18]  Hwee Pink Tan,et al.  Crowdsourcing with Tullock contests: A new perspective , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[19]  Kai Han,et al.  BLISS: Budget LImited robuSt crowdSensing through online learning , 2014, 2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON).

[20]  Raymond Hemmecke,et al.  Nonlinear Integer Programming , 2009, 50 Years of Integer Programming.

[21]  Klara Nahrstedt,et al.  Quality of Information Aware Incentive Mechanisms for Mobile Crowd Sensing Systems , 2015, MobiHoc.

[22]  Siméon-Denis Poisson Recherches sur la probabilité des jugements en matière criminelle et en matiére civile, précédées des règles générales du calcul des probabilités , 1837 .

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

[24]  Arpita Ghosh,et al.  Optimal Contest Design for Simple Agents , 2016, TEAC.

[25]  Laurence A. Wolsey,et al.  An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..

[26]  Kai Han,et al.  Taming the Uncertainty: Budget Limited Robust Crowdsensing Through Online Learning , 2016, IEEE/ACM Transactions on Networking.

[27]  Jörg Schimmelpfennig,et al.  Modern Industrial Organization , 2014 .

[28]  S. M. Samuels On the Number of Successes in Independent Trials , 1965 .

[29]  Andreas Krause,et al.  Submodular Function Maximization , 2014, Tractability.

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

[31]  Constantinos Daskalakis,et al.  Testing Poisson Binomial Distributions , 2014, SODA.

[32]  Iordanis Koutsopoulos,et al.  Optimal incentive-driven design of participatory sensing systems , 2013, 2013 Proceedings IEEE INFOCOM.

[33]  Yili Hong,et al.  On computing the distribution function for the Poisson binomial distribution , 2013, Comput. Stat. Data Anal..

[34]  Guihai Chen,et al.  Pay as How Well You Do: A Quality Based Incentive Mechanism for Crowdsensing , 2015, MobiHoc.

[35]  Xiaohong Hao,et al.  More with less: lowering user burden in mobile crowdsourcing through compressive sensing , 2015, UbiComp.

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