The Namer-Claimer game

Ben Barber

The Namer-Claimer game

Ben Barber

Research output: Contribution to journal › Article (Academic Journal) › peer-review

77 Downloads (Pure)

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

Access to Document

Full-text PDF (submitted manuscript)
This is the submitted manuscript (AAM). This version is also available online via arXiv at https://arxiv.org/abs/1808.10800v1 . Please refer to any applicable terms of use of the publisher.
Submitted manuscript, 113 KB

Handle.net

Persistent link

Cite this

@article{a7c2aa0c05574a77b7c852f838b84d9b,

title = "The Namer-Claimer game",

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. ",

author = "Ben Barber",

year = "2018",

month = aug,

day = "31",

language = "English",

journal = "arXiv",

publisher = "Cornell University",

}

TY - JOUR

T1 - The Namer-Claimer game

AU - Barber, Ben

PY - 2018/8/31

Y1 - 2018/8/31

N2 - 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.

AB - 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.

UR - http://arxiv.org/abs/1808.10800v1

M3 - Article (Academic Journal)

JO - arXiv

JF - arXiv

ER -

The Namer-Claimer game

Abstract

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this