Abstract: This paper studies the incentive mechanism in a multi-server, multi-client federated learning (FL) scenario and models the task allocation and pricing as multiple reverse auction problem. Firstly, local model performance of clients is evaluated in each round according to Chebyshev's theorem, and exponential decay function is used to evaluate the historical performance of clients. Then, a local model performance based reverse auction (LPRA) algorithm is designed to solve the task allocation and pricing problems with the goal of maximizing the overall performance of clients participating in FL. Through theoretical analysis, it is confirmed that LPRA algorithm satisfies individual rationality, truthfulness and computational efficiency. Finally, the effectiveness of the LPRA algorithm is verified by simulated experiments.
Keywords: federated learning (FL); incentive mechanism; Chebyshev's theorem; reverse auction; individual rationality