Oblivious and Adaptive Strategies for the Majority and Plurality Problems
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball of the majority color (i.e., a color that occurs for more than ⌈ n/2 ⌉ times). The Plurality problem has exactly the same setting while the goal is to find a ball of the dominant color (i.e., a color that occurs most often). Previous literature regarding this topic dealt mainly with adaptive strategies, whereas in this paper we focus more on the oblivious (i.e., non-adaptive) strategies. Given that our strategies are oblivious, we establish a linear upper bound for the Majority problem with arbitrarily many different colors. We then show that the Plurality problem is significantly more difficult by establishing quadratic lower and upper bounds. In the end, we also discuss some generalized upper bounds for adaptive strategies in the k-color Plurality problem.
Unable to display preview. Download preview PDF.
- 3.Aigner, M., De Marco, G., Montangero, M.: The Plurality Problem with Three Colors and More. Theoretical Computer Science (2005) (to appear)Google Scholar
- 4.Alon, N.: Eigenvalues and Expanders. Combinatorica 6, 86–96 (1986)Google Scholar
- 8.Chung, F.R.K.: Spectral Graph Theory. CBMS Lecture Notes. AMS Publications, Providence (1997)Google Scholar
- 9.Chung, F.R.K., Graham, R.L., Mao, J., Yao, A.C.: Finding Favorites. In: Electronic Colloquium on Computational Complexity (ECCC), p–78 (2003)Google Scholar
- 10.Fischer, M.J., Salzberg, S.L.: Finding a Majority among n Votes. J. Algorithms 3, 375–379 (1982)Google Scholar
- 11.Knuth, D.E.: personal communicationGoogle Scholar
- 16.Taylor, A., Zwicker, W.: personal communicationGoogle Scholar