Full Text:
<10>
CLC number:
On-line Access: 2025-10-13
Received: 2025-02-14
Revision Accepted: 2025-07-31
Crosschecked: 0000-00-00
Cited: 0
Clicked: 28
Privacy-preserving bipartite consensus with cooperative-competitive interactions via node decomposition strategy
| |||||||||||||
Licheng WANG1, Yongling CHEN1, Shuai LIU2. Privacy-preserving bipartite consensus with cooperative-competitive interactions via node decomposition strategy[J]. Frontiers of Information Technology & Electronic Engineering, 1998, -1(-1): .
@article{title="Privacy-preserving bipartite consensus with cooperative-competitive interactions via node decomposition strategy",
author="Licheng WANG1, Yongling CHEN1, Shuai LIU2",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="-1",
number="-1",
pages="",
year="1998",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.2500093"
}
%0 Journal Article
%T Privacy-preserving bipartite consensus with cooperative-competitive interactions via node decomposition strategy
%A Licheng WANG1
%A Yongling CHEN1
%A Shuai LIU2
%J Journal of Zhejiang University SCIENCE C
%V -1
%N -1
%P
%@ 2095-9184
%D 1998
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.2500093
TY - JOUR
T1 - Privacy-preserving bipartite consensus with cooperative-competitive interactions via node decomposition strategy
A1 - Licheng WANG1
A1 - Yongling CHEN1
A1 - Shuai LIU2
J0 - Journal of Zhejiang University Science C
VL - -1
IS - -1
SP -
EP -
%@ 2095-9184
Y1 - 1998
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.2500093
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.
Open peer comments: Debate/Discuss/Question/Opinion
<1>