The Plurality Problem with Three Colors
The plurality problem with three colors is a game between two participants: 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 \leq L(n) \leq \lfloor 5n/3 \rfloor - 2\)
KeywordsBipartite Graph Fault Diagnosis Slovak Republic Color Class Randomize Algorithm
Unable to display preview. Download preview PDF.
- 2.Aigner, M.: Two colors and more (preprint)Google Scholar
- 5.Alonso, L., Chassaing, P., Reingold, E.M., Schott, R.: The chip problem (preprint), Available at http://emr.cs.uiuc.edu/~reingold/chips.ps
- 7.Fisher, M., Salzberg, S.: Finding a majority among n votes. Journal of Algorithms 3, 375–379 (1982)Google Scholar
- 9.Wiener, G.: Search for a majority element. Journal of Statistical Planning and Inference (to appear)Google Scholar