The Namer-Claimer game

• Published in 2018
• Added on 2018-09-04

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.

Links

• http://arxiv.org/abs/1808.10800v1
• http://arxiv.org/pdf/1808.10800v1

Other information

BibTeX entry

@article{TheNamerClaimergame,
	key = {TheNamerClaimergame},
	type = {article},
	title = {The Namer-Claimer game},
	author = {Ben Barber},
	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.},
	comment = {},
	date_added = {2018-09-04},
	date_published = {2018-10-09},
	urls = {http://arxiv.org/abs/1808.10800v1,http://arxiv.org/pdf/1808.10800v1},
	collections = {Easily explained,Games to play with friends},
	url = {http://arxiv.org/abs/1808.10800v1 http://arxiv.org/pdf/1808.10800v1},
	year = 2018,
	urldate = {2018-09-04},
	archivePrefix = {arXiv},
	eprint = {1808.10800},
	primaryClass = {math.CO}
}