A cyclic representation of discrete coordination procedures

Authors:
R. P. Agaev;P. Yu. Chebotarev
Affiliations:
Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia;Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2012

Citing 3
Cited 0

Social and Economic Networks

Social and Economic Networks
Dynamic models of informational control in social networks

Automation and Remote Control
The projection method for reaching consensus and the regularized power limit of a stochastic matrix

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that any discrete opinion pooling procedure with positive weights can be asymptotically approximated by DeGroot's procedure whose communication digraph is a Hamiltonian cycle with loops. In this cycle, the weight of each arc (which is not a loop) is inversely proportional to the influence of the agent the arc leads to.