Interval consensus: From quantized gossip to voting
Lists
Only you see this
Abstract
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 by-product of this convergence result, we show that the majority voting problem is solvable with only 2 bits of memory per agent.
BibTeX
@inproceedings{benezit2009interval,
author = {Florence Bénézit and Patrick Thiran and Martin Vetterli},
title = {{Interval consensus: From quantized gossip to voting}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2009},
url = {https://openreview.net/forum?id=pfuh3zM64D},
}Loading related content...