Mobile Crowdsourcing Task Allocation Based on Dynamic Self-Attention GANs

Crowdsourcing technology is widely recognized for its effectiveness in task scheduling and resource allocation.While traditional methods for task allocation can help reduce costs and improve efficiency,they may encounter challenges when dealing with abnormal data flow nodes,leading to decreased allocation accuracy and efficiency.To address these issues,this study proposes a novel two-part invalid detection task allocation framework.In the first step,an anomaly detection model is developed using a dynamic self-attentive GAN to identify anomalous data.Compared to the baseline method,the model achieves an approximately 4%increase in the F1 value on the public dataset.In the second step of the framework,task allocation modeling is performed using a twopart graph matching method.This phase introduces a P-queue KM algorithm that implements a more efficient optimization strategy.The allocation efficiency is improved by approximately 23.83%compared to the baseline method.Empirical results confirm the effectiveness of the proposed framework in detecting abnormal data nodes,enhancing allocation precision,and achieving efficient allocation.

Friendship-aware task planning in mobile crowdsourcing

Recently, crowdsourcing platforms have attracted a number of citizens to perform a variety of location- specific tasks. However, most existing approaches consider the arrangement of a set of tasks for a set of crowd workers, while few consider crowd workers arriving in a dynamic manner. Therefore, how to arrange suitable location-specific tasks to a set of crowd workers such that the crowd workers obtain maximum satisfaction when arriving sequentially represents a challenge. To address the limitation of existing approaches, we first identify a more general and useful model that considers not only the arrangement of a set of tasks to a set of crowd workers, but also all the dynamic arrivals of all crowd workers. Then, we present an effective crowd-task model which is applied to offiine and online settings, respectively. To solve the problem in an offiine setting, we first observe the characteristics of task planning （CTP） and devise a CTP algorithm to solve the problem. We also propose an effective greedy method and integrated simulated annealing （ISA） techniques to improve the algorithm performance. To solve the problem in an online setting, we develop a greedy algorithm for task planning. Finally, we verify the effectiveness and efficiency of the proposed solutions through extensive experiments using real and synthetic datasets.

An Integrated Incentive Framework for Mobile Crowdsourced Sensing

Currently, mobile devices （e.g., smartphones） are equipped with multiple wireless interfaces and rich builtin functional sensors that possess powerful computation and communication capabilities, and enable numerous Mobile Crowdsourced Sensing （MCS） applications. Generally, an MCS system is composed of three components： a publisher of sensing tasks, crowd participants who complete the crowdsourced tasks for some kinds of rewards, and the crowdsourcing platform that facilitates the interaction between publishers and crowd participants. Incentives are a fundamental issue in MCS. This paper proposes an integrated incentive framework for MCS, which appropriately utilizes three widely used incentive methods： reverse auction, gamification, and reputation updating. Firstly, a reverse-auction-based two-round participant selection mechanism is proposed to incentivize crowds to actively participate and provide high-quality sensing data. Secondly, in order to avoid untruthful publisher feedback about sensing-data quality, a gamification-based verification mechanism is designed to evaluate the truthfulness of the publisher＇s feedback. Finally, the platform updates the reputation of both participants and publishers based on their corresponding behaviors. This integrated incentive mechanism can motivate participants to provide high-quality sensed contents, stimulate publishers to give truthful feedback, and make the platform profitable.