Privacy-preserving bipartite consensus with cooperative–competitive interactions via a node decomposition strategy
摘要
This paper describes our investigation of the privacy protection problem of multi-agent systems under cooperative–competitive networks. A node decomposition strategy is used to protect the privacy of the initial node values, in which a node vi is split into ni nodes. 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 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.