The majority game with an arbitrary majority
From MaRDI portal
Publication:284827
DOI10.1016/J.DAM.2015.12.016zbMATH Open1336.05001arXiv1402.5913OpenAlexW1501675551MaRDI QIDQ284827FDOQ284827
Authors: John R. Britnell, Mark Wildon
Publication date: 18 May 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1402.5913
Recommendations
Cites Work
- Title not available (Why is that?)
- On computing majority by comparisons
- Variants of the majority problem.
- Beyond knights and knaves
- Title not available (Why is that?)
- The plurality problem with three colors and more.
- Search for a majority element
- Determining the majority
- Computing majority with triple queries
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)