Beyond Knights and Knaves

Cheng, Chih-Hsien; McConvey, Andrew; Onderko, Drew; Shar, Nathaniel; Tomlinson, Charles

doi:10.1007/978-3-642-45043-3_34

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2016

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We refer the reader to [1] and the recent preprint [3] for a number of results on further questions that arise in this setting.…”

Section: Introductionmentioning

confidence: 99%

The majority game with an arbitrary majority

Britnell

Wildon

2016

Discrete Applied Mathematics

View full text Add to dashboard Cite

Abstract. 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 weight of 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.

show abstract

“…We refer the reader to [1] and the recent preprint [3] for a number of results on further questions that arise in this setting.…”

Section: Introductionmentioning

confidence: 99%