跳到主要导航 跳到搜索 跳到主要内容

Differentially Private Distributed Resource Allocation via Gradient Perturbation

  • Beijing Institute of Technology
  • Southeast University, Nanjing

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

Despite progress in distributed resource allocation (DRA) over multi-agent networks, it remains challenging to make allocation decisions while preserving sensitive information during inter-agent communication, particularly over general directed graphs. The hard balance constraint, which requires supply-demand consistency throughout the execution process, further complicates the problem. To address these challenges, this pa per proposes a gradient-perturbed framework for differentially private distributed resource allocation that ensures ε-differential privacy, almost sure convergence, and hard balance constraint satisfaction. For general directed networks, the framework employs an affine transformation based on the out-degree Laplacian matrix, along with gradient estimation and a fixed step size, ensuring almost sure convergence to the optimal solution at a linear rate. A reduced-order variant is also developed for undirected graphs to enhance communication and computational efficiency by exploiting network symmetry. Theoretical analysis establishes the convergence and privacy guarantees, and numerical simulations confirm the effectiveness of the proposed approach.

源语言英语
期刊IEEE Transactions on Automatic Control
DOI
出版状态已接受/待刊 - 2026

学术指纹

探究 'Differentially Private Distributed Resource Allocation via Gradient Perturbation' 的科研主题。它们共同构成独一无二的学术指纹。

引用此