We show how to select an item with the majority color from n two-colored items, given
access to the items only through an oracle that returns the discrepancy of subsets of k items …

We consider a game played by two players, Paul and Carol. At the beginning of the game,
Carol fixes a coloring of n balls. At each turn, Paul chooses a pair of the balls and asks Carol …

Given a set of n balls each colored with a color, a ball is said to be a majority, k-majority, or
plurality ball if its color class has size larger than half of the number of balls, has size at least …

Diagnosing the quality of components in fault-tolerant computer systems often requires
numerous tests with limited resources. It is usually the case that repeated tests on a …

We consider a game played by two players, Paul and Carol. Carol fixes a coloring of n balls
with three colors. At each step, Paul chooses a pair of balls and asks Carol whether the balls …

We study two models of the Majority problem. We are given n balls and an unknown coloring
of them with two colors. We can ask sets of balls of size k as queries, and in the so-called …

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 …

We study the following combinatorial problem. Let B be the set of balls such that each ball is
in one of two colors, and let k≥ 2 be an integer. A query consists of selecting k balls from the …

We consider a game played by two players, Paul and Carol. Carol fixes a coloring of n balls
with three colors. At each step, Paul chooses a pair of balls and asks Carol whether the balls …

The Plurality problem-introduced by Aigner\cite {A2004}-has many variants. In this article we
deal with the following version: suppose we are given $ n $ balls, each of them colored by …