Dynamic Incentive Mechanism Design for Distributed Learning in 5G Private Networks: A Generalized Benders Decomposition Approach
In the 5G private network environment, to incentivize data providers to contribute data and computational resources for enhancing the generalization capability and model accuracy of distributed learning systems, this paper proposes a dynamic incentive mechanism based on Generalized Benders Decomposition (GBD). We model the interaction between the system administrator and data providers as a Stackelberg game, where the incentive strategy of the system administrator is optimized to achieve maximum system revenue while meeting the generalization requirements. To address the coupling in the leader-follower problem, we design an algorithm based on GBD, enabling the system administrator to dynamically guide the resource contributions of data providers through iterative incentive adjustments. Experimental results demonstrate that the proposed dynamic incentive mechanism outperforms baseline schemes in terms of generalization capability, system revenue, resource contribution level, and model training accuracy.
Authors
- Feng Hu (ORCID: https://orcid.org/0000-0002-0865-0206)
- X.T. Zu (ORCID: https://orcid.org/0009-0002-2178-2665)
- Decui Liang (ORCID: https://orcid.org/0000-0002-0655-1255)
- Yanfei Liu (ORCID: https://orcid.org/0000-0001-7706-6495)
Publication Details
- Published
- 2024-12-27
- DOI
- https://doi.org/10.1109/eiecc64539.2024.10929311
- Citations
- 1
- Primary Topic
- Cooperative Communication and Network Coding
- Type
- article
- Field-Weighted Citation Impact
- 0.35