Positional Games
Combinatorics
2014-04-11 v1
Abstract
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs. It is closely connected to many other combinatorial disciplines such as Ramsey theory, extremal graph and set theory, probabilistic combinatorics, and to computer science. We survey the basic notions of the field, its approaches and tools, as well as numerous recent advances, standing open problems and promising research directions.
Keywords
Cite
@article{arxiv.1404.2731,
title = {Positional Games},
author = {Michael Krivelevich},
journal= {arXiv preprint arXiv:1404.2731},
year = {2014}
}
Comments
Submitted to Proceedings of the ICM 2014