Average-Case Lower Bounds for the Plurality Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Algorithms Year : 2008

Average-Case Lower Bounds for the Plurality Problem

Abstract

Given a set of $n$ elements, each of which is colored one of $c \geq 2$ colors, we have to determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal color comparisons of elements. We derive lower bounds for the expected number of color comparisons when the $c^n$ colorings are equally probable. We prove a general lower bound of $\frac{c}{3} n - O( \sqrt n)$ for $c \geq 2$; we prove the stronger particular bounds of $\frac{7}{6} n - O(\sqrt n)$ for $c=3$, $\frac{54}{35} n - O(\sqrt n)$ for $c = 4$, $\frac{607}{315}n-O(\sqrt n)$ for $c=5$, $\frac{1592}{693}n - O(\sqrt n)$ for $c = 6$, $\frac{7985}{3003} n - O(\sqrt n)$ for $c = 7$, and $\frac{19402}{6435} n - O(\sqrt n)$ for $c = 8$.
No file

Dates and versions

inria-00169183 , version 1 (02-09-2007)

Identifiers

Cite

Laurent Alonso, Edward M. Reingold. Average-Case Lower Bounds for the Plurality Problem. ACM Transactions on Algorithms, 2008, 4 (3), pp.27:1,27:17. ⟨10.1145/1367064.1367067⟩. ⟨inria-00169183⟩
55 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More