31 October 2023 in IEEE Internet of Things Journal
Mobile crowdsourcing (MCS) is an emerging paradigm that harnesses the collective power of the crowd to tackle large-scale tasks. To ensure the high-quality worker selection, various combinatorial multiarmed bandit (CMAB)-based schemes have been proposed. However, previous schemes often overlook critical issues. First, the post-unknown worker recruitment (PUWR) problem emerges when the quality of a worker remains unknown despite reported worker data. Second, the presence of Sybil Requesters is often neglected, who manipulate ratings to deceive workers for malicious purposes. To tackle these challenges, we present an innovative scheme called bi-directional trust verification-based CMAB (BTV-CMAB). First, we propose a truth quality discovery approach that effectively addresses the PUWR problem by estimating worker quality. Additionally, we employ a BTV mechanism to assess the Degree of Trust (DoT) of requesters and the reputation of workers. To select top-notch workers for MCS, we combine the worker quality and reputation into an upper confidence bound (UCB) index. The effectiveness of the BTV-CMAB scheme is supported by theoretical proof, which demonstrates its ability to ensure truthfulness and individual rationality. Furthermore, experimental results reveal promising improvements achieved by our scheme, including a 17.44%, increase in the platform’s revenue and a significant decrease in regret of up to 88.26%. To the best of our knowledge, this study is the first to propose utilizing a BTV mechanism to effectively address the PUWR problem and counter the threat of Sybil attacks in the CMAB-based worker recruitment process.
28 December 2023 in IEEE Internet of Things Journal
The Energy Internet (EI) aims to build a sustainable energy ecosystem by connecting diverse energy sources and prosumers. Mobile Crowd Sensing (MCS) enables efficient data collection for monitoring and aggregation from distributed devices. Given the complex behavior of workers driven by self-interest, recruiting trustworthy, high-quality, and inexpensive workers remains a significant challenge in research and practice. Previous studies often assume that worker characteristics are known or can be obtained after data collection. However, evaluating worker qualities is quite challenging in the face of multi-source data and complex workers. To address this, we propose a Completion Rate Learning based Multi-Armed Bandit reverse Auction (CRL-MABA) scheme for identifying and selecting high-quality workers in MCS. Our CRL-MABA scheme first proposes a Spatial-Temporal Upper Confidence Bound (STUCB) method to recruit workers, considering both the quality of workers for exploitation and the spatiotemporal features for exploration. In addition, the Dual-Stage Data Estimation Mechanism (DSDEM) and Long-Term and Short-Term Memory Learning (LTSTML) are designed to identify workers accurately and efficiently. Importantly, our proposed scheme avoids the impractical assumptions in previous works while satisfying important criteria such as truthfulness, individual rationality, and computational efficiency. The effectiveness of our scheme is demonstrated through extensive experimental results, which show its superiority over existing strategies.
28 April 2023 in Computer Communications
23 October 2026 in ACM Transactions on Information Systems
An unfair recommender system can exacerbate social biases, degrade user experience, and even pose legal and ethical risks. Therefore, detecting disadvantaged subgroups of users who exhibit significant underperformance is important for optimizing and improving recommender systems. Existing methods only identify Attribute-based Disadvantaged Subgroups ( ADS s), neglecting disadvantaged subgroups caused by the interaction process between users and items (Interaction correlated Disadvantaged Subgroups, IDS s). To address this limitation, we propose FINDUS , a fairness-oriented interaction aware disadvantaged subgroup detection approach for recommender systems. This is the first work capable of detecting IDS s. In FINDUS , a collaborative grouping mechanism is used to detect IDS s. It is based on multi round bidirectional mapping between users and items to generate interaction attributes. To overcome the attribute explosion problem caused by combinations of attribute constraints during subgroup detection, we also devise a scoring and pruning method founded on upper-bound estimation. Extensive experiments are carried out on multiple real world datasets, and the results demonstrate that FINDUS can effectively and efficiently identify a diverse set of unfairly treated user subgroups, including both ADS s and IDS s.