Random strategies are nearly optimal for generalized van der Waerden games

DOI10.1016/j.endm.2017.07.037zbMath1378.05131OpenAlexW2742995112MaRDI QIDQ1690015

Tibor Szabó, Juanjo Rué, Christopher Kusch, Christoph Spiegel

Publication date: 18 January 2018

Full work available at URL: http://hdl.handle.net/2117/111534

zbMATH Keywords

maker-breaker gamesgeneral winning criteriageneralised van der Waerden games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

A new bound for the Maker-Breaker triangle game

Cites Work

• Van der Waerden and Ramsey type games
• Positional games
• Primitive Recursive Bounds for Van Der Waerden Numbers
• Biased Positional Games
• Solving a linear equation in a set of integers I
• Rado Partition Theorem for Random Subsets of Integers
• Combinatorial Games
• A Construction for Partitions Which Avoid Long Arithmetic Progressions
• Biased positional games for which random strategies are nearly optimal
• A new proof of Szemerédi's theorem

This page was built for publication: Random strategies are nearly optimal for generalized van der Waerden games