Information Processing Letters
The Average-Case Complexity of Determining the Majority
SIAM Journal on Computing
How to Play the Majority Game with Liars
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Hi-index | 0.89 |
We show that (n-12) pairwise equality comparisons are necessary and sufficient (in the worst case) to find a plurality in n colored balls.