Computing Incentive and Data Offloading in Digital Twin Networks: A Contract Theory and Multi-Agent Deep Reinforcement Learning Approach

Nan Zhao, Henan Xu, Yuxiang Su, Bokun He, Fan Zhang, Jing Tang, Sheng Hu

In the digital twin (DT) network, effective edge data processing is essential to meet the real-time requirements of DT models. However, edge servers (ESs) are self-interested and have limited computation resources. The virtual content operator (VCO) cannot observe their true computing capabilities, leading to participation reluctance and information asymmetry. To address these challenges, this paper proposes a contract-learning integration method for computing incentive and data offloading. A two-dimensional computation-reward contract incentive mechanism is designed to motivate ESs to provide computation resources for data pre-processing, where both continuous and discrete distributions of ES types are considered. Then, ESs upload the processed results to the VCO for DT model mapping, synchronization, and final construction. Based on the individual rationality and incentive compatibility constraints, the optimal incentive reward and computing resource allocation strategies are analytically derived to maximize the VCO’s utility. Then, based on the signed contracts, a multi-agent double deep Q-network algorithm is developed to jointly optimize the binary data offloading decision, transmission bandwidth, and transmission power for the minimal system delay. The algorithm learns adaptive strategies in the dynamic network environment and mitigates Q-value overestimation. Numerical results demonstrate that the proposed method improves system performance in terms of computing incentive and data offloading.