Randomized gossip algorithms for achieving consensus on the majority vote
2013 (English)In: Proc. 11th IFAC International Workshop on Adaptation and Learning in Control and Signal Processing, 2013Conference paper (Refereed)
This paper studies a decentralized, randomized gossip algorithm for computing a majority vote amongst the binary decisions associated to n nodes organized in a fixed, ad-hoc network. It is indicated how this problem can be reduced to computing the global average using a standard, randomized gossip algorithm. Then, we illustrate how the majority vote problem allows one to formulate individual stopping rules deciding when an individual node makes its final verdict. Finally, we will provide an illustration of how well the algorithm and associated stopping rule behaves.
Place, publisher, year, edition, pages
Research subject Electrical Engineering with specialization in Systems Analysis
IdentifiersURN: urn:nbn:se:uu:diva-213205OAI: oai:DiVA.org:uu-213205DiVA: diva2:681147
ALCOSP 2013, July 3-5, University of Caen Basse-Normandie, Caen, France
FunderSwedish Research Council, 621-2007-6364