MAB-RSP: Data pricing based on Stackelberg game in MCS

Abstract

With the proliferation of mobile smart devices and wireless communication technologies, Mobile CrowdSensing (MCS) has emerged as a significant data collection method. MCS faces two key challenges: selecting high-quality data sellers with unknown reliability and determining fair compensation that addresses device wear and privacy risks. We introduce two novel contributions. First, the MAB-RS algorithm leverages multi-armed bandit reinforcement learning and a data freshness model to dynamically optimize seller recruitment, efficiently balancing exploration of unknown sellers and exploitation of high-quality ones. Second, the MAB-RSP employs a Stackelberg game framework, enabling platforms and sellers to collaboratively maximize profits through strategic pricing and participation incentives. Experiments demonstrate that the algorithm improves revenue while ensuring balanced benefits for all participants.