Article ID Journal Published Year Pages File Type
419839 Discrete Applied Mathematics 2008 7 Pages PDF
Abstract

We consider a game played by two players, Paul and Carol. At the beginning of the game, Carol fixes a coloring of nn balls. At each turn, Paul chooses a pair of the balls and asks Carol whether the balls have the same color. Carol truthfully answers his question. Paul’s goal is to determine the most frequent (plurality) color in the coloring by asking as few questions as possible. The game is studied in the probabilistic setting when Paul is allowed to choose his next question randomly.We give asymptotically tight bounds both for the case of two colors and many colors. For the balls colored by kk colors, we prove a lower bound Ω(kn)Ω(kn) on the expected number of questions; this is asymptotically optimal. For the balls colored by two colors, we provide a strategy for Paul to determine the plurality color with the expected number of 2n/3+O(nlogn) questions; this almost matches the lower bound 2n/3−O(n).

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , ,