Flocking and Consensus
A number of agents exchange their values asynchronously and form weighted averages with (possibly outdated) values possessed by their neighbors.
Under rather weak conditions, the agents are guaranteed to converge to a common value.
This scheme is described and analyzed in:
The main convergence result is stated as Lemma 2.1 of:
A simplified version is presented in Section 7.3 of:
and is then used in Section 7.6 for combining the updates of different agents interested in solving a common optimization problem.
For an overview of convergence results and some extensions, see:
V. D. Blondel, J. M. Hendrickx, A. Olshevsky, and J. N. Tsitsiklis,
"Convergence in Multiagent Coordination, Consensus, and Flocking," in Proceedings of the
Joint 44th IEEE Conference on Decision
and Control and European Control Conference (CDC-ECC'05), Seville, Spain, December 2005.
Convergence rate analysis
A model with a continuum of agents and limited connectivity: