The Namer-Claimer game

Ben Barber

Research output: Contribution to journalArticle (Academic Journal)peer-review

38 Downloads (Pure)


In each round of the Namer-Claimer game, Namer names a distance d, then Claimer claims a subset of [n] that does not contain two points that differ by d. Claimer wins once they have claimed sets covering [n]. I show that the length of this game is of order log log n with optimal play from each side.
Original languageEnglish
Number of pages7
Publication statusSubmitted - 31 Aug 2018


Dive into the research topics of 'The Namer-Claimer game'. Together they form a unique fingerprint.

Cite this