A Double Auction Mechanism for Mobile Crowd Sensing with Data Reuse
Xiaoru Zhang, Lin Gao, Bin Cao, Zhang Li, Mengjing Wang

TL;DR
This paper introduces a novel double auction mechanism for Mobile Crowd Sensing that leverages data reuse among tasks, significantly increasing social welfare and addressing private information challenges.
Contribution
It proposes a truthful, optimal double auction mechanism for MCS with data reuse, handling both symmetric and asymmetric information scenarios.
Findings
Data reuse increases social welfare by up to 380%.
The proposed auction mechanism is truthful and optimal under certain conditions.
Introducing reserve prices balances social efficiency and budget constraints.
Abstract
Mobile Crowd Sensing (MCS) is a new paradigm of sensing, which can achieve a flexible and scalable sensing coverage with a low deployment cost, by employing mobile users/devices to perform sensing tasks. In this work, we propose a novel MCS framework with data reuse, where multiple tasks with common data requirement can share (reuse) the common data with each other through an MCS platform. We study the optimal assignment of mobile users and tasks (with data reuse) systematically, under both information symmetry and asymmetry, depending on whether the user cost and the task valuation are public information. In the former case, we formulate the assignment problem as a generalized Knapsack problem and solve the problem by using classic algorithms. In the latter case, we propose a truthful and optimal double auction mechanism, built upon the above Knapsack assignment problem, to elicit the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Crowdsensing and Crowdsourcing · Auction Theory and Applications · Smart Parking Systems Research
