Publication | Closed Access
How to crowdsource tasks truthfully without sacrificing utility: Online incentive mechanisms with budget constraint
391
Citations
27
References
2014
Year
Unknown Venue
Electronic AuctionEngineeringOnline Auction ModelGame TheoryCommunicationMarket DesignOnline Incentive MechanismsData ScienceBiasExperimental EconomicsAlgorithmic Mechanism DesignHuman ComputationMechanism DesignOnline MechanismsPublic PolicyBudget ConstraintData PrivacyMobile ComputingComputer ScienceCrowdsourcingCrowd ComputingEdge ComputingIncentive MechanismSocial ComputingCloud ComputingBusinessConsumer SovereigntyIncentive Model
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1