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

• URL: http://arxiv.org/abs/2309.12113v2
• Date: Wed, 3 Jan 2024 02:53:30 GMT
• Title: Incentivizing Massive Unknown Workers for Budget-Limited Crowdsensing: From Off-Line and On-Line Perspectives
• Authors: Feng Li, Yuqi Chai, Huan Yang, Pengfei Hu, Lingjie Duan
• Abstract summary: We propose an off-line Context-Aware CMAB-based Incentive (CACI) mechanism. We also extend the idea to the on-line setting where unknown workers may join in or depart from the systems.
• Score: 31.24314338983544
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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.

Related papers

• Co-Supervised Learning: Improving Weak-to-Strong Generalization with Hierarchical Mixture of Experts [81.37287967870589]
  We propose to harness a diverse set of specialized teachers, instead of a single generalist one, that collectively supervises the strong student. Our approach resembles the classical hierarchical mixture of experts, with two components tailored for co-supervision. We validate the proposed method through visual recognition tasks on the OpenAI weak-to-strong benchmark and additional multi-domain datasets.
  arXiv  Detail & Related papers  (2024-02-23T18:56:11Z)
• Refined Mechanism Design for Approximately Structured Priors via Active Regression [50.71772232237571]
  We consider the problem of a revenue-maximizing seller with a large number of items for sale to $n$ strategic bidders. It is well-known that optimal and even approximately-optimal mechanisms for this setting are notoriously difficult to characterize or compute.
  arXiv  Detail & Related papers  (2023-10-11T20:34:17Z)
• Incentive Mechanism for Uncertain Tasks under Differential Privacy [17.058734221792964]
  Mobile crowd sensing (MCS) has emerged as an increasingly popular sensing paradigm due to its cost-effectiveness. This paper presents HERALD*, an incentive mechanism that addresses issues through the use of uncertainty and hidden bids.
  arXiv  Detail & Related papers  (2023-05-26T10:15:02Z)
• Fairness for Workers Who Pull the Arms: An Index Based Policy for Allocation of Restless Bandit Tasks [30.323831598899773]
  We consider a novel RMAB setting, called multi-worker restless bandits (MWRMAB) with heterogeneous workers. The goal is to plan an intervention schedule that maximizes the expected reward while satisfying budget constraints on each worker. Our contributions are two-fold: (1) we provide a multi-worker extension of the Whittle index to tackle heterogeneous costs and per-worker budget and (2) we develop an index-based scheduling policy to achieve fairness.
  arXiv  Detail & Related papers  (2023-03-01T19:59:42Z)
• Skill-Based Reinforcement Learning with Intrinsic Reward Matching [77.34726150561087]
  We present Intrinsic Reward Matching (IRM), which unifies task-agnostic skill pretraining and task-aware finetuning. IRM enables us to utilize pretrained skills far more effectively than previous skill selection methods.
  arXiv  Detail & Related papers  (2022-10-14T00:04:49Z)
• Pessimism meets VCG: Learning Dynamic Mechanism Design via Offline Reinforcement Learning [114.36124979578896]
  We design a dynamic mechanism using offline reinforcement learning algorithms. Our algorithm is based on the pessimism principle and only requires a mild assumption on the coverage of the offline data set.
  arXiv  Detail & Related papers  (2022-05-05T05:44:26Z)
• Online Auction-Based Incentive Mechanism Design for Horizontal Federated Learning with Budget Constraint [9.503584357135832]
  Federated learning makes it possible for all parties with data isolation to train the model collaboratively and efficiently. To obtain a high-quality model, an incentive mechanism is necessary to motivate more high-quality workers with data and computing power. We propose a reverse auction-based online incentive mechanism for horizontal federated learning with budget constraint.
  arXiv  Detail & Related papers  (2022-01-22T13:37:52Z)
• Auction-Based Ex-Post-Payment Incentive Mechanism Design for Horizontal Federated Learning with Reputation and Contribution Measurement [9.503584357135832]
  Federated learning trains models across devices with distributed data, while protecting the privacy and obtaining a model similar to that of centralized ML. We design an auction-based incentive mechanism for horizontal federated learning with reputation and contribution measurement.
  arXiv  Detail & Related papers  (2022-01-07T11:44:20Z)
• Harnessing Context for Budget-Limited Crowdsensing with Massive Uncertain Workers [26.835745787064337]
  We propose a Context-Aware Worker Selection (CAWS) algorithm in this paper. CAWS aims at maximizing the expected total sensing revenue efficiently with both budget constraint and capacity constraints respected.
  arXiv  Detail & Related papers  (2021-07-03T09:09:07Z)
• Explanations of Machine Learning predictions: a mandatory step for its application to Operational Processes [61.20223338508952]
  Credit Risk Modelling plays a paramount role. Recent machine and deep learning techniques have been applied to the task. We suggest to use LIME technique to tackle the explainability problem in this field.
  arXiv  Detail & Related papers  (2020-12-30T10:27:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.