I will present the general notion of (weighted) averaging algorithms and the particular Metropolis algorithm which achieves consensus on the average of initial values in the case of networks with bidirectional communication links. This algorithm converges in quadratic time, even in the case of a dynamic network but, unfortunately, requires each agent to be aware of its current outdegree. I will then present different variants of Metropolis to circumvent this important limitation.
