×

A cyclic representation of discrete coordination procedures. (English. Russian original) Zbl 1307.93019

Autom. Remote Control 73, No. 1, 161-166 (2012); translation from Avtom. Telemekh. 2012, No. 1, 178-183 (2012).
Summary: 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.

MSC:

93A14 Decentralized systems
93B40 Computational methods in systems theory (MSC2010)
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] DeGroot, M.H., Reaching a Consensus, J. Am. Stat. Ass., 1974, vol. 69, pp. 118–121. · Zbl 0282.92011 · doi:10.1080/01621459.1974.10480137
[2] Agaev, R.P. and Chebotarev, P.Yu., The ProjectionMethod for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix, Autom. Remote Control, 2011, vol. 72, no. 12, pp. 2458–2476. · Zbl 1269.93002 · doi:10.1134/S0005117911120034
[3] Tutte, W.T., Graph Theory, Reading: Addison-Wesley, 1984. Translated under the title Teoriya grafov, Moscow: Mir, 1988.
[4] Chebotarev, P. and Agaev, R., Forest Matrices Around the Laplacian Matrix, Linear Algebra Appl., 2002, vol. 356, pp. 253–274. · Zbl 1017.05073 · doi:10.1016/S0024-3795(02)00388-9
[5] Wentzell, A.D. and Freidlin, M.I., On Small Random Perturbations of Dynamical Systems, Russ. Math. Surveys, 1970, vol. 25, no. 1, pp. 1–55. · Zbl 0297.34053
[6] Agaev, R.P. and Chebotarev, P.Yu., The Matrix of Maximum Out Forests of a Digraph and Its Applications, Autom. Remote Control, 2000, vol. 61, no. 9, pp. 1424–1450. · Zbl 1057.05038
[7] Jackson, M.O., Social and Economic Networks, Princeton: Princeton Univ. Press, 2008. · Zbl 1149.91051
[8] Agaev, R.P. and Chebotarev, P.Yu., Convergence and Stability in Consensus and Coordination Problems (A Survey of Basic Results), Upravlen. Bol’shimi Sist., 2010, vol. 30, no. 1, pp. 470–505.
[9] Gilardoni, G.L. and Clayton, M.K., On Reaching a Consensus Using DeGroot’s Iterative Pooling, Ann. Stat., 1993, vol. 21, pp. 391–401. · Zbl 0770.62001 · doi:10.1214/aos/1176349032
[10] Barabanov, I.N., Korgin, N.A., Novikov, D.A. and Chkhartishvili, A.G., Dynamic Models of Informational Control in Social Networks, Autom. Remote Control, 2010, vol. 71, no. 11, pp. 2417–2426. · Zbl 1214.91092 · doi:10.1134/S0005117910110135
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.