移动众测中具有长期激励的未知员工招聘

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Mobile Computing Pub Date : 2024-09-30 DOI:10.1109/TMC.2024.3471569
Qihang Zhou;Xinglin Zhang;Zheng Yang
{"title":"移动众测中具有长期激励的未知员工招聘","authors":"Qihang Zhou;Xinglin Zhang;Zheng Yang","doi":"10.1109/TMC.2024.3471569","DOIUrl":null,"url":null,"abstract":"Many mobile crowdsensing applications require efficient recruitment of workers whose qualities are often unknown a priori. While prior research has explored multi-armed bandit-based mechanisms with short-term incentives to address this unknown worker recruitment challenge, these mechanisms mostly neglect the enduring participation issues stemming from privacy concern and selection starvation in the long-term task. Therefore, in this paper, we focus on incentivizing long-term participation of unknown workers, thereby providing crucial assurance for crowdsensing applications. We first establish an auction framework based on shuffle differential privacy (SDP), where we leverage SDP’s privacy amplification effect to mitigate privacy-related utility loss when dealing with the privacy-sensitive worker and the utility-sensitive platform. Following this, we model the selection requirements of workers as fairness constraints and propose two novel fairness-aware incentive mechanisms, GFA and IFA, to ensure group and individual fairness for unknown workers, respectively. Theoretical analyses highlight the desirable properties of GFA and IFA, complemented by an in-depth exploration of fairness violation and regret. Finally, numerical simulations are conducted on two real-world datasets, validating the superior performance of the proposed mechanisms.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 2","pages":"999-1015"},"PeriodicalIF":7.7000,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Unknown Worker Recruitment With Long-Term Incentive in Mobile Crowdsensing\",\"authors\":\"Qihang Zhou;Xinglin Zhang;Zheng Yang\",\"doi\":\"10.1109/TMC.2024.3471569\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many mobile crowdsensing applications require efficient recruitment of workers whose qualities are often unknown a priori. While prior research has explored multi-armed bandit-based mechanisms with short-term incentives to address this unknown worker recruitment challenge, these mechanisms mostly neglect the enduring participation issues stemming from privacy concern and selection starvation in the long-term task. Therefore, in this paper, we focus on incentivizing long-term participation of unknown workers, thereby providing crucial assurance for crowdsensing applications. We first establish an auction framework based on shuffle differential privacy (SDP), where we leverage SDP’s privacy amplification effect to mitigate privacy-related utility loss when dealing with the privacy-sensitive worker and the utility-sensitive platform. Following this, we model the selection requirements of workers as fairness constraints and propose two novel fairness-aware incentive mechanisms, GFA and IFA, to ensure group and individual fairness for unknown workers, respectively. Theoretical analyses highlight the desirable properties of GFA and IFA, complemented by an in-depth exploration of fairness violation and regret. Finally, numerical simulations are conducted on two real-world datasets, validating the superior performance of the proposed mechanisms.\",\"PeriodicalId\":50389,\"journal\":{\"name\":\"IEEE Transactions on Mobile Computing\",\"volume\":\"24 2\",\"pages\":\"999-1015\"},\"PeriodicalIF\":7.7000,\"publicationDate\":\"2024-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Mobile Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10700691/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10700691/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

许多移动众测应用需要高效招聘员工,而这些员工的素质往往是先天未知的。虽然先前的研究已经探索了基于多武装强盗的短期激励机制来解决这一未知的工人招聘挑战,但这些机制大多忽视了长期任务中由隐私问题和选择饥饿引起的持久参与问题。因此,在本文中,我们专注于激励未知工人的长期参与,从而为众感应用提供关键保证。我们首先建立了一个基于洗牌差分隐私(SDP)的拍卖框架,在处理隐私敏感的工作人员和效用敏感的平台时,我们利用SDP的隐私放大效应来减轻与隐私相关的效用损失。在此基础上,我们将工人的选择要求建模为公平约束,并提出了两种新的公平意识激励机制GFA和IFA,分别确保未知工人的群体和个人公平。理论分析强调了GFA和IFA的可取之处,并对公平违反和遗憾进行了深入探讨。最后,在两个真实数据集上进行了数值模拟,验证了所提出机制的优越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Unknown Worker Recruitment With Long-Term Incentive in Mobile Crowdsensing
Many mobile crowdsensing applications require efficient recruitment of workers whose qualities are often unknown a priori. While prior research has explored multi-armed bandit-based mechanisms with short-term incentives to address this unknown worker recruitment challenge, these mechanisms mostly neglect the enduring participation issues stemming from privacy concern and selection starvation in the long-term task. Therefore, in this paper, we focus on incentivizing long-term participation of unknown workers, thereby providing crucial assurance for crowdsensing applications. We first establish an auction framework based on shuffle differential privacy (SDP), where we leverage SDP’s privacy amplification effect to mitigate privacy-related utility loss when dealing with the privacy-sensitive worker and the utility-sensitive platform. Following this, we model the selection requirements of workers as fairness constraints and propose two novel fairness-aware incentive mechanisms, GFA and IFA, to ensure group and individual fairness for unknown workers, respectively. Theoretical analyses highlight the desirable properties of GFA and IFA, complemented by an in-depth exploration of fairness violation and regret. Finally, numerical simulations are conducted on two real-world datasets, validating the superior performance of the proposed mechanisms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
期刊最新文献
Harmonizing Global and Local Class Imbalance for Federated Learning O-RAN-Enabled Intelligent Network Slicing to Meet Service-Level Agreement (SLA) CV-Cast: Computer Vision–Oriented Linear Coding and Transmission AdaWiFi, Collaborative WiFi Sensing for Cross-Environment Adaptation BIT-FL: Blockchain-Enabled Incentivized and Secure Federated Learning Framework
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1