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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Incentive Mechanism Design for Distributed Learning in 5G Private Networks: A Generalized Benders Decomposition Approach

Feng Hu, X.T. Zu, Decui Liang, Yanfei Liu
1 citations
Cooperative Communication and Network Coding
0.35
article

Dynamic Incentive Mechanism Design for Distributed Learning in 5G Private Networks: A Generalized Benders Decomposition Approach

Feng Hu, X.T. Zu, Decui Liang, Yanfei Liu
article en
1 citations

Abstract

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.

Openalex Percentile: Top 33%
Cooperative Communication and Network Coding
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.