TY - CHAP
T1 - Fair Incentive Mechanism for Mobile Crowdsensing
AU - Li, Youqi
AU - Li, Fan
AU - Yang, Song
AU - Zhang, Chuan
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.
PY - 2024
Y1 - 2024
N2 - In this chapter, we jointly address practical issues in the incentive mechanism for MCS to fairly incentivize high-quality users’ participation, like (1) the platform has no knowledge about users’ sensing qualities beforehand due to their private information. (2) The platform needs users’ continuous participation in the long run, which results in fairness requirements. (3) It is also crucial to protect users’ privacy due to the potential privacy leakage concerns (e.g., sensing qualities) after completing tasks. Particularly, we propose the three-stage Stackelberg-based incentive mechanism for the platform to recruit participants. In detail, we leverage combinatorial volatile multi-armed bandits (CVMAB) to elicit unknown users’ sensing qualities. We use the drift-plus-penalty (DPP) technique in Lyapunov optimization to handle the fairness requirements. We blur the quality feedback with tunable Laplacian noise such that the incentive mechanism protects locally differential privacy (LDP). Finally, we carry out experiments to evaluate our incentive mechanism. The numerical results show that our incentive mechanism achieves sublinear regret performance to learn unknown quality with fairness and privacy guarantee.
AB - In this chapter, we jointly address practical issues in the incentive mechanism for MCS to fairly incentivize high-quality users’ participation, like (1) the platform has no knowledge about users’ sensing qualities beforehand due to their private information. (2) The platform needs users’ continuous participation in the long run, which results in fairness requirements. (3) It is also crucial to protect users’ privacy due to the potential privacy leakage concerns (e.g., sensing qualities) after completing tasks. Particularly, we propose the three-stage Stackelberg-based incentive mechanism for the platform to recruit participants. In detail, we leverage combinatorial volatile multi-armed bandits (CVMAB) to elicit unknown users’ sensing qualities. We use the drift-plus-penalty (DPP) technique in Lyapunov optimization to handle the fairness requirements. We blur the quality feedback with tunable Laplacian noise such that the incentive mechanism protects locally differential privacy (LDP). Finally, we carry out experiments to evaluate our incentive mechanism. The numerical results show that our incentive mechanism achieves sublinear regret performance to learn unknown quality with fairness and privacy guarantee.
KW - Combinatorial volatile multi-armed bandits
KW - Fair guarantee
KW - Locally differential privacy
KW - Stackelberg game
KW - Unknown quality
UR - http://www.scopus.com/inward/record.url?scp=85182818555&partnerID=8YFLogxK
U2 - 10.1007/978-981-99-6921-0_3
DO - 10.1007/978-981-99-6921-0_3
M3 - Chapter
AN - SCOPUS:85182818555
T3 - SpringerBriefs in Computer Science
SP - 39
EP - 69
BT - SpringerBriefs in Computer Science
PB - Springer
ER -