Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Incentivizing Massive Unknown Workers for Budget-Limited Crowdsensing: From Off-Line and On-Line Perspectives (2309.12113v2)

Published 21 Sep 2023 in cs.AI

Abstract: How to incentivize strategic workers using limited budget is a very fundamental problem for crowdsensing systems; nevertheless, since the sensing abilities of the workers may not always be known as prior knowledge due to the diversities of their sensor devices and behaviors, it is difficult to properly select and pay the unknown workers. Although the uncertainties of the workers can be addressed by the standard Combinatorial Multi-Armed Bandit (CMAB) framework in existing proposals through a trade-off between exploration and exploitation, we may not have sufficient budget to enable the trade-off among the individual workers, especially when the number of the workers is huge while the budget is limited. Moreover, the standard CMAB usually assumes the workers always stay in the system, whereas the workers may join in or depart from the system over time, such that what we have learnt for an individual worker cannot be applied after the worker leaves. To address the above challenging issues, in this paper, we first propose an off-line Context-Aware CMAB-based Incentive (CACI) mechanism. We innovate in leveraging the exploration-exploitation trade-off in an elaborately partitioned context space instead of the individual workers, to effectively incentivize the massive unknown workers with a very limited budget. We also extend the above basic idea to the on-line setting where unknown workers may join in or depart from the systems dynamically, and propose an on-line version of the CACI mechanism. We perform rigorous theoretical analysis to reveal the upper bounds on the regrets of our CACI mechanisms and to prove their truthfulness and individual rationality, respectively. Extensive experiments on both synthetic and real datasets are also conducted to verify the efficacy of our mechanisms.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (44)
  1. Yelp Dataset: www.yelp.com/dataset/challenge.
  2. A Truthful Budget Feasible Multi-Armed Bandit Mechanism for Crowdsourcing Time Critical Tasks. In Proc. of the 14th AAMAS, page 1101–1109, 2015.
  3. Volatile Multi-Armed Bandits for Guaranteed Targeted Social Crawling. In Proc. of the 27th AAAI, pages 16–21, 2013.
  4. A Survey on Mobile Crowdsensing Systems: Challenges, Solutions, and Opportunities. IEEE Communications Surveys & Tutorials, 21(3):2419–2465, 2019.
  5. D. Dubhashi and A. Panconesi. Concentration of measure for the analysis of randomized algorithms. Cambridge University Press, 2009.
  6. TRAC: Truthful Auction for Location-aware Collaborative Sensing in Mobile Crowdsourcing. In Proc. of 33rd IEEE INFOCOM, pages 1231–1239, 2014.
  7. Auction-Based Combinatorial Multi-Armed Bandit Mechanisms with Strategic Arms. In Proc. of the 40th IEEE INFOCOM, pages 1–10, 2021.
  8. Combinatorial Multi-Armed Bandit Based Unknown Worker Recruitment in Heterogeneous Crowdsensing. In Proc. of the 39th IEEE INFOCOM, pages 179–188, 2020.
  9. Unknown Worker Recruitment with Budget and Covering Constraints for Mobile Crowdsensing. In Proc. of the 25th IEEE ICPADS, pages 539–547, 2019.
  10. Truthful Incentive Mechanism for Nondeterministic Crowdsensing with Vehicles. IEEE Trans. on Mobile Computing, 17(12):2982–2997, 2018.
  11. Taming the Uncertainty: Budget Limited Robust Crowdsensing Through Online Learning. IEEE/ACM Trans. on Networking, 24(3):1462–1475, 2016.
  12. Online Organizing Large-scale Heterogeneous Tasks and Multi-skilled Participants in Mobile Crowdsensing. IEEE Trans. on Mobile Computing, 22(5):2892–2909, 2023.
  13. Context-Aware Recruitment Scheme for Opportunistic Mobile Crowdsensing. In Proc. of the 21st IEEE ICPADS, pages 266–273, 2015.
  14. Toward Optimal Allocation of Location Dependent Tasks in Crowdsensing. In Proc. of 33rd IEEE INFOCOM, pages 745–753, 2014.
  15. CrowdPatrol: A Mobile Crowdsensing Framework for Traffic Violation Hotspot Patrolling. IEEE Trans. on Mobile Computing, 2021.
  16. Mobile Phone Sensing Systems: A Survey. IEEE Communications Surveys & Tutorials, 15(1):402–427, 2013.
  17. R. Kleinberg. Nearly Tight Bounds for the Continuum-Armed Bandit Problem. In Proc. of the 18th NIPS, pages 697–704, 2004.
  18. Regret Bounds for Sleeping Experts and Bandits. Machine Learning, 80(2-3):245–272, 2010.
  19. Multi-Armed Bandits in Metric Spaces. In Proc. of the 40th ACM STOC, pages 681–690, 2008.
  20. E. Lawler. Fast Approximation Algorithms for Knapsack Problems. In Proc. of the 18th SFCS, 1977.
  21. Three-Stage Stackelberg Long-Term Incentive Mechanism and Monetization for Mobile Crowdsensing: An Online Learning Approach. IEEE Trans. on Network Science and Engineering, 8(2):1385–1398, 2021.
  22. DDoS Mitigation Based on Space-Time Flow Regularities in IoV: A Feature Adaption Reinforcement Learning Approach. IEEE Trans. on Intelligent Transportation Systems, 23(3):2262–2278, 2022.
  23. Third-Eye: A Mobilephone-Enabled Crowdsensing System for Air Quality Monitoring. Proc. of the ACM on Interactive, Mobile, Wearable and Utiquitous Technologies, 2(1):1–26, 2018.
  24. Context-Aware Data Quality Estimation in Mobile Crowdsensing. In Proc. of the 36th IEEE INFOCOM, pages 1–9, 2017.
  25. Context-Aware Hierarchical Online Learning for Performance Maximization in Mobile Crowdsourcing. IEEE/ACM Trans. on Networking, 26(3):1334–1347, 2018.
  26. Data Quality Guided Incentive Mechanism Design for Crowdsensing. IEEE Trans. on Mobile Computing, 17(2):307–319, 2018.
  27. A. Rangi and M. Franceschetti. Multi-Armed Bandit Algorithms for Crowdsourcing Systems with Online Estimation of Workers’ Ability. In Proc. of the 17th AAMAS, page 1345–1352, 2018.
  28. Y. Song and H. Jin. Minimizing Entropy for Crowdcourcing with Combinatorial Multi-Armed Bandit. In Proc. of the 40th IEEE INFOCOM, pages 1–10, 2021.
  29. Epsilon–First Policies for Budget–Limited Multi-Armed Bandits. In Proc. of the 14th AAAI, 2010.
  30. Efficient Crowdsourcing of Unknown Experts using Bounded Multi-Armed Bandits. Artificial Intelligence, 214:89–111, 2014.
  31. Context-Aware Computing for Mobile Crowd Sensing: A survey. Future Generation Computer Systems, 99:321–332, 2019.
  32. V. Vazirani. Approximation algorithms. Springer, 2001.
  33. WOLoc: WiFi-only Outdoor Localization Using Crowdsensed Hotspot Labels. In Proc. of the 36th IEEE INFOCOM, pages 1–9, 2017.
  34. A Context-Aware Multiarmed Bandit Incentive Mechanism for Mobile Crowd Sensing Systems. IEEE Internet of Things Journal, 6(5):7648–7658, 2019.
  35. CMAB-based Reverse Auction for Unknown Worker Recruitment in Mobile Crowdsensing. IEEE Trans. on Mobile Computing, 2021.
  36. Unknown Worker Recruitment in Mobile Crowdsensing Using CMAB and Auction. In Proc. of the 40th IEEE ICDCS, pages 1145–1155, 2020.
  37. iLogBook: Enabling Text-Searchable Event Query Using Sparse Vehicle-Mounted GPS Data. IEEE Trans. on Intelligent Transportation Systems, 20(12):4328–4338, 2019.
  38. QoS-Based Budget Constrained Stable Task Assignment in Mobile Crowdsensing. IEEE Trans. on Mobile Computing, 20(11):3194–3210, 2021.
  39. Context-Awareness for Mobile Sensing: A Survey and Future Directions. IEEE Communications Surveys & Tutorials, 18(1):68–93, 2016.
  40. Incentives for Mobile Crowd Sensing: A Survey. IEEE Communications Surveys & Tutorials, 18(1):54–67, 2016.
  41. How to Crowdsource Tasks Truthfully without Sacrificing Utility: Online Incentive Mechanisms with Budget Constraint. In Proc. of the 33rd IEEE INFOCOM, pages 1213–1221, 2014.
  42. Budget-Feasible Online Incentive Mechanisms for Crowdsourcing Tasks Truthfully. IEEE Trans. on Networking, 24(2):647–661, 2016.
  43. Differentially Private Unknown Worker Recruitment for Mobile Crowdsensing Using Multi-Armed Bandits. IEEE Trans. on Mobile Computing, 20(9):2779–2794, 2021.
  44. On Designing Strategy-Proof Budget Feasible Online Mechanisms for Mobile Crowdsensing With Time-Discounting Values. IEEE Trans. on Mobile Computing, 21(6):2088–2102, 2022.
Citations (4)

Summary

We haven't generated a summary for this paper yet.