Publication Date:
2004
Short description:
The Plurality Problem with Three Colors / M., Aigner; G., De Marco; Montangero, Manuela. - STAMPA. - 2996:(2004), pp. 513-521. ( 21st Annual Symposium on Theoretical Aspects of Computer Science Montpellier, FRANCE APR, 2004) [10.1007/978-3-540-24749-4_45].
abstract:
The plurality problem with three colors is a game between twoparticipants: Paul and Carol. Suppose we are given $n$ balls colored with three colors. At any step of the game, Paul chooses two balls and asks whether they are of the same color, whereupon Carol answers yes or no. The game ends when Paul either produces a ball $a$ of the plurality color (meaning that the number of balls colored like $a$ exceeds those of the other colors), or when Paul states that there is no plurality. How many questions L(n) does Paul have to ask in the worst case? We show that 3 \lfloor n/2 \rfloor - 2 <= L(n) <= \lfloor 5n/3 \rfloor-2.
Iris type:
Relazione in Atti di Convegno
Keywords:
Combinatorics; lower bound
List of contributors:
M., Aigner; G., De Marco; Montangero, Manuela
Book title:
STACS 2004, PROCEEDINGS
Published in: