The paper explores privacy concerns in distributed resource allocation over directed networks. It introduces the DP-DGT algorithm to obfuscate exchanged messages using Laplacian noise, ensuring convergence to optimal solutions. The study addresses privacy issues in economic dispatch problems and provides a comprehensive comparison of related decentralized algorithms. The proposed algorithm focuses on privacy guarantees for δ-adjacent distributed resource allocation problems, relaxing bounded gradient assumptions. The convergence analysis demonstrates the algorithm's ability to converge to a neighborhood of the optimal solution, even with non-convex objectives. Numerical simulations validate the effectiveness of the proposed algorithm.
Sang ngôn ngữ khác
từ nội dung nguồn
arxiv.org
Thông tin chi tiết chính được chắt lọc từ
by Wei Huo,Xiao... lúc arxiv.org 03-28-2024
https://arxiv.org/pdf/2403.18275.pdfYêu cầu sâu hơn