Privacy-preserving bipartite consensus with cooperative–competitive interactions via a node decomposition strategy
Regular Papers|Updated:2026-01-07
|
Privacy-preserving bipartite consensus with cooperative–competitive interactions via a node decomposition strategy
Enhanced Publication
基于节点分解隐私保护策略的合作—竞争二分一致性
“In the realm of multi-agent systems, a groundbreaking study has emerged, addressing the privacy protection issue within cooperative-competitive networks. The research introduces a node decomposition strategy to safeguard initial node values, effectively shielding them from both honest-but-curious nodes and eavesdroppers. This innovation paves the way for a privacy-preserving consensus algorithm, ensuring privacy performance is maintained without external algorithmic support. The study's findings are bolstered by two numerical simulations, underscoring the efficacy of the proposed algorithm in achieving bipartite consensus.”
Frontiers of Information Technology & Electronic EngineeringVol. 26, Issue 11, Pages: 2114-2127(2025)
Affiliations:
1.College of Automation Engineering, Shanghai University of Electric Power, Shanghai 200090, China
2.College of Science, University of Shanghai for Science and Technology, Shanghai 200093, China