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.
| Original language | English |
|---|---|
| Number of pages | 7 |
| Journal | arXiv |
| Publication status | Submitted - 31 Aug 2018 |