.png){kind=icon}
Return
Manufacturing Consent
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2014.2349591.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a variant of the gossip algorithm wherein a controller can influence the values at a subset of nodes as well as the averaging weights. This leads to three optimization problems: (i) Optimal choice of nodes: a combinatorial optimization problem for which we propose a nonlinear programming relaxation as well as a greedy heuristic; (ii) Parametric optimization of weights: a non-convex optimization for which we propose an effective heuristic for a special case; (iii) Dynamic adjustment of weights: an optimal control problem. For the dynamic case, we note some empirically observed interesting critical phenomena for the uncontrolled case.
Keywords:
Gossip algorithms
opinion dynamics
optimal control
optimal node placement
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more