上传
计算机科学
斯塔克伯格竞赛
试验台
块链
移动设备
计算机安全
利润最大化
无线
服务器
纳什均衡
分布式计算
利润(经济学)
计算机网络
操作系统
微观经济学
经济
标识
DOI:10.1080/17445760.2021.2004411
摘要
This paper focuses on a mobile-crowd federated learning system that includes a central server and a set of mobile devices. The server, acting as a model requester, motivates all devices to train an accurate model by paying them based on their individual contributions. Each participating device needs to balance between the training rewards and costs for profit maximization. A Stackelberg game is proposed to model interactions between the server and devices. To match with reality, our model takes the training deadline and the device-side upload time into consideration. Two reward policies, i.e. the size-based policy and accuracy-based policy, are compared. The existence and uniqueness of Stackelberg equilibrium (SE) under both policies are analyzed. We show that there is a lower bound of 0.5 on the price of anarchy in the proposed game. We extend our model by considering the uncertainty in the upload time. We also utilize the blockchain technique to ensure a truthful, trust-free, and fair system. This paper also analyzes how devices maximize their utilities when making profits via training and blockchain mining in the fixed-upload-time setting. A blockchain-powered testbed is implemented, and experiments are conducted to validate our analysis.
科研通智能强力驱动
Strongly Powered by AbleSci AI