Incentive Mechanisms for Discretized Mobile Crowdsensings

In crowdsensing to mobile phones, each user needs incentives to participate. Mobile devices with sensing capabilities have enabled a new paradigm of mobile crowdsensing with a broad range of applications. A major challenge in achieving stable crowdsensing on a large scale is the incentive issue. Proper incentive mechanisms are necessary to keep the crowdsensing working. However, most existing incentive mechanisms for crowdsensing assume the system admit continuous strategies like sensing time in opposite of the fact that many digital devices and crowdsensing models only admit discretized strategies. In this paper, we show that discretization, like rounding method, can make the existing crowdsensing incentive mechanisms invalid. To address this problem, we design the incentive mechanism for discrete crowdsensing in which each user has a uniform sensing subtask length. We rigorously show that our mechanism can achieve perfect Bayesian equilibrium (PBE) and maximize the platform utility. Our algorithm is efficient since its complexity is linear to the number of users. We also consider the cases in which the users have diverse subtask lengths, and propose another two incentive mechanisms to achieve PBEs and maximize platform utility. Extensive simulations verify our mechanisms are efficient, individual-rational, and system-optimal.

[1]  Rick Kazman,et al.  The metropolis model a new logic for development of crowdsourced systems , 2009, CACM.

[2]  Ravi S. Sandhu,et al.  Role-Based Access Control Models , 1996, Computer.

[3]  Sheng Zhong,et al.  INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding , 2010, 2010 Proceedings IEEE INFOCOM.

[4]  Andrew S. Tanenbaum,et al.  Distributed systems: Principles and Paradigms , 2001 .

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

[6]  Cecilia Mascolo,et al.  ParkSense: a smartphone based sensing system for on-street parking , 2013, MobiCom.

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

[8]  Soon Ae Chun,et al.  Sensors and Crowdsourcing for Environmental Awareness and Emergency Planning , 2012 .

[9]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Lada A. Adamic,et al.  Crowdsourcing with all-pay auctions: A field experiment on Taskcn , 2011, ASIST.

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

[12]  Maja Vukovic,et al.  Crowdsourcing for Enterprises , 2009, 2009 Congress on Services - I.

[13]  Hojung Cha,et al.  Automatically characterizing places with opportunistic crowdsensing using smartphones , 2012, UbiComp.

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

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

[16]  Deepak Ganesan,et al.  TruCentive: A game-theoretic incentive platform for trustworthy mobile crowdsourcing parking services , 2012, 2012 15th International IEEE Conference on Intelligent Transportation Systems.

[17]  Alon Y. Halevy,et al.  Crowdsourcing systems on the World-Wide Web , 2011, Commun. ACM.

[18]  Jitendra Malik,et al.  Recovering high dynamic range radiance maps from photographs , 1997, SIGGRAPH.

[19]  Lionel M. Ni,et al.  iMac: Strategy-Proof Incentive Mechanism for Mobile Crowdsourcing , 2013, WASA.

[20]  John C. Harsanyi,et al.  Games with Incomplete Information Played by "Bayesian" Players, I-III: Part I. The Basic Model& , 2004, Manag. Sci..

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

[22]  R. Selten Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.

[23]  David P. Anderson,et al.  SETI@home: an experiment in public-resource computing , 2002, CACM.

[24]  Jon Postel,et al.  Transmission Control Protocol , 1981, RFC.

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

[26]  J. Nash NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[27]  Nancy A. Lynch,et al.  Atomic Transactions: In Concurrent and Distributed Systems , 1993 .

[28]  David P. Anderson,et al.  SETI@home-massively distributed computing for SETI , 2001, Comput. Sci. Eng..

[29]  Balasubramanian Sivan,et al.  Optimal Crowdsourcing Contests , 2011, Encyclopedia of Algorithms.

[30]  G.E. Kaiser,et al.  A network architecture for reliable distributed computing , 1987, IEEE Network.

[31]  Nathan Eagle,et al.  txteagle: Mobile Crowdsourcing , 2009, HCI.

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

[33]  Fan Wu,et al.  On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks , 2007, MobiCom '07.

[34]  Paul W. Goldberg,et al.  The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..

[35]  Fan Wu,et al.  Incentive-compatible opportunistic routing for wireless networks , 2008, MobiCom '08.

[36]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

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

[39]  H. Moulin,et al.  Strategyproof sharing of submodular costs:budget balance versus efficiency , 2001 .

[40]  Vijay V. Vazirani,et al.  Group Strategyproofness and No Subsidy via LP-Duality , 1999 .

[41]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[42]  D. Elliott Bell,et al.  Secure Computer System: Unified Exposition and Multics Interpretation , 1976 .

[43]  Xi Fang,et al.  Truthful incentive mechanisms for k-anonymity location privacy , 2013, 2013 Proceedings IEEE INFOCOM.