Sciweavers

Share
ICASSP
2009
IEEE

Interval consensus: From quantized gossip to voting

10 years 4 months ago
Interval consensus: From quantized gossip to voting
We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Instead, our algorithm reaches consensus on the quantized interval that contains the average. We prove that this consensus in reached in finite time almost surely. As a byproduct of this convergence result, we show that the majority voting problem is solvable with only 2 bits of memory per agent.
Florence Bénézit, Patrick Thiran, Ma
Added 21 May 2010
Updated 21 May 2010
Type Conference
Year 2009
Where ICASSP
Authors Florence Bénézit, Patrick Thiran, Martin Vetterli
Comments (0)
books