Publication

Interval consensus: from quantized gossip to voting

Martin Vetterli, Patrick Thiran, Florence Bénézit
2009
Conference Papers

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 byproduct of this convergence result, we show that the majority voting problem is solvable with only 2 bits of memory per agent.

Official source

https://infoscience.epfl.ch/entities/publication/771acffd-4c26-4ff9-b758-6b32ef443e3f

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Interval consensus: from quantized gossip to voting

Chat with Graph Search

Robust Sparse Voting

Predicting party switching through machine learning and open data

Convex Quantization Preserves Logconcavity