Affiliation(s): 1College of Automation Engineering, Shanghai University of Electric Power, Shanghai 200090, China
2College of Science, University of Shanghai for Science and Technology, Shanghai 200093, China
Abstract: This paper describes our investigation of the privacy protection problem of multi-agent systems under cooperative-competitive networks. The node decomposition strategy is used to protect the privacy of initial node values, in which a node vi is split into ni nodes, where ni represents the number of its neighbors. By designing inter-node weights, the initial value of each node is protected from honest-but-curious nodes and eavesdroppers without relying on external algorithms. The purpose of the addressing this problem is to design a privacy-preserving consensus algorithm such that the privacy performance is guaranteed by using the node decomposition strategy while the bipartite consensus is achieved for the cooperative-competitive multi-agent systems. Two numerical simulations are given to validate the effectiveness of the proposed privacy-preserving bipartite consensus algorithm.
Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article
Reference
Open peer comments: Debate/Discuss/Question/Opinion
Open peer comments: Debate/Discuss/Question/Opinion
<1>