The majority game with an arbitrary majority
From MaRDI portal
Abstract: The -majority game is played with numbered balls, each coloured with one of two colours. It is given that there are at least balls of the majority colour, where is a fixed integer greater than . On each turn the player selects two balls to compare, and it is revealed whether they are of the same colour; the player's aim is to determine a ball of the majority colour. It has been correctly stated by Aigner that the minimum number of comparisons necessary to guarantee success is , where is the weight of the binary expansion of . However his proof contains an error. We give an alternative proof of this result, which generalizes an argument of Saks and Werman.
Recommendations
Cites work
- Beyond knights and knaves
- Computing majority with triple queries
- Determining the majority
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 922674 (Why is no real title available?)
- On computing majority by comparisons
- Search for a majority element
- The plurality problem with three colors and more.
- Variants of the majority problem.
Cited in
(5)
This page was built for publication: The majority game with an arbitrary majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284827)