The Distributed Multiple Voting Problem

A networked set of agents holding binary opinions does not seem to be able to compute its majority opinion by means of local binary interactions only. However, the majority problem can be solved using two or more bits, instead of one (F. Bénézit , "Interval consensus: From quantized gossip to...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE journal of selected topics in signal processing 2011-08, Vol.5 (4), p.791-804
Hauptverfasser:	Benezit, F., Thiran, P., Vetterli, M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Algorithms Approximation algorithms Automata Automation Color Convergence Density classification distributed estimation Fonts Frogs gossip algorithms Intervals Mathematical models Probabilistic logic Quantization Signal processing Voting voting problem
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!