The Namer-Claimer game
Combinatorics
2018-09-03 v1
Abstract
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.
Cite
@article{arxiv.1808.10800,
title = {The Namer-Claimer game},
author = {Ben Barber},
journal= {arXiv preprint arXiv:1808.10800},
year = {2018}
}
Comments
7 pages