eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2016-06-22
9:1
9:14
10.4230/LIPIcs.SWAT.2016.9
article
Randomized Algorithms for Finding a Majority Element
Gawrychowski, Pawel
Suomela, Jukka
Uznanski, Przemyslaw
Given n colored balls, we want to detect if more than n/2 of them have the same color, and if so find one ball with such majority color. We are only allowed to choose two balls and compare their colors, and the goal is to minimize the total number of such operations. A well-known exercise is to show how to find such a ball with only 2n comparisons while using only a logarithmic number of bits for bookkeeping. The resulting algorithm is called the Boyer-Moore majority vote algorithm. It is known that any deterministic method needs 3n/2-2 comparisons in the worst case, and this is tight. However, it is not clear what is the required number of comparisons if we allow randomization. We construct a randomized algorithm which always correctly finds a ball of the majority color (or detects that there is none) using, with high probability, only 7n/6+o(n) comparisons. We also prove that the expected number of comparisons used by any such randomized method is at least 1.019n.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol053-swat2016/LIPIcs.SWAT.2016.9/LIPIcs.SWAT.2016.9.pdf
majority
randomized algorithms
lower bounds