Abstract
Effective incentive mechanisms are invaluable in crowdsensing to stimulate the enthusiasm of strategic users. However, existing work focusing on multi-task allocation with the objective of purely maximizing the social utility may result in the problem of unbalanced allocation, which may damage the social fairness. This motivates us to introduce proportional fairness into the design of a novel fairness-aware incentive mechanism for the first time. Specifically, we first model the interaction of multi-task allocation in crowdsensing as a multi-requester multi-worker Stackelberg game, and then transform the fairness-aware multi-task allocation problem into a fairness-aware incentive mechanism design problem. Next, we prove that there is a unique Stackelberg equilibrium, and also show that it can be efficiently derived through cautiously proposed algorithms. Since the existing equilibrium may not be optimal, we further design a secondary allocation rule to maximize both social utility and system performance, while achieving proportional fairness at a minimum cost. Finally, extensive experiments using both synthetic and real-world datasets demonstrate the superiority of our proposed mechanism compared to the state of the arts.
Original language | English |
---|---|
Pages (from-to) | 990-1000 |
Number of pages | 11 |
Journal | IEEE Transactions on Services Computing |
Volume | 17 |
Issue number | 3 |
Early online date | 18 Oct 2023 |
DOIs | |
Publication status | Published - May 2024 |
Bibliographical note
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.
This document is the author’s post-print version, incorporating any revisions agreed during the peer-review process. Some differences between the published version and this version may remain and you are advised to consult the published version if you wish to cite from it
Funder
10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 62372343, 62272417 and 62072411)Zhejiang Provincial Natural Science Foundation of China (Grant Number: LR21F020001)
Key Research and Development Program of Hubei Province (Grant Number: 2023BEB024)
Funding
National Natural Science Foundation of China (Grant Number: 62372343, 62272417 and 62072411) Zhejiang Provincial Natural Science Foundation of China (Grant Number: LR21F020001) Key Research and Development Program of Hubei Province (Grant Number: 2023BEB024)
Funders | Funder number |
---|---|
National Natural Science Foundation of China | 62372343, 62272417, 62072411 |
Zhejiang Provincial Natural Science Foundation | LR21F020001 |
Key Research and Development Program of Hubei Province | 2023BEB024 |
Wuhan University of Science and Technology |
Keywords
- Costs
- Crowdsensing
- Games
- Multitasking
- Resource management
- Sensors
- Stackelberg game
- Task analysis
- crowdsensing
- incentive mechanism
- multi-task allocation
- proportional fairness
ASJC Scopus subject areas
- Information Systems and Management
- Hardware and Architecture
- Computer Networks and Communications
- Computer Science Applications