ePrints

The majority game with an arbitrary majority

Lookup NU author(s): Dr John Britnell

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

© 2016 Elsevier B.V. All rights reserved.The k-majority game is played with n numbered balls, each coloured with one of two colours. It is given that there are at least k balls of the majority colour, where k is a fixed integer greater than n/2. 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 2(n-k)-B(n-k), where B(m) is the number of 1s in the binary expansion of m. However his proof contains an error. We give an alternative proof of this result, which generalizes an argument of Saks and Werman.

Publication metadata

Author(s): Britnell JR, Wildon M

Publication type: Article

Publication status: Published

Journal: Discrete Applied Mathematics

Year: 2016

Volume: 208

Pages: 1-6

Print publication date: 31/07/2016

Online publication date: 11/04/2016

Acceptance date: 21/12/2015

ISSN (print): 0166-218X

ISSN (electronic): 1872-6771

Publisher: Elsevier B.V.

URL: https://doi.org/10.1016/j.dam.2015.12.016

DOI: 10.1016/j.dam.2015.12.016

Altmetrics

Share