Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Two Colors and More
verfasst von : Martin Aigner
Erschienen in: Entropy, Search, Complexity
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Suppose we are given
n
balls colored with two colors. How many color-comparisons are needed to produce a ball of the majority color? The answer (first given by Saks and Werman) is
M
(
n
) =
n−B
(
n
), where
B
(
n
) is the number of 1’s in the binary representation of
n
. We consider in this paper several generalizations and variants of the majority problem such as producing a
k
-majority ball, determining the color status of all balls, arbitrarily many colors, the plurality problem, and the closely related liar problem.