Efficient Winning Strategies in Random‐Turn Maker–Breaker Games

DOI10.1002/JGT.22072zbMath1366.91036arXiv1408.5684OpenAlexW2163142777MaRDI QIDQ5272928

Michael Krivelevich, Gal Kronenberg, Asaf Ferber

Publication date: 5 July 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.5684

zbMATH Keywords

random graphspositional gamesmaker-breaker games

Mathematics Subject Classification ID

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

Related Items (3)

Fast winning strategies for the maker-breaker domination game ⋮ Random-player maker-breaker games ⋮ Maker-breaker domination number

Cites Work

• Limit distribution for the existence of Hamiltonian cycles in a random graph
• A solution to the Box Game
• Weak and strong \(k\)-connectivity games
• Fast winning strategies in maker-breaker games
• Hitting time results for Maker-Breaker games
• Building Spanning Trees Quickly in Maker-Breaker Games
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Random-Turn Hex and Other Selection Games
• Biased Positional Games
• A Solution of the Shannon Switching Game
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: Efficient Winning Strategies in Random‐Turn Maker–Breaker Games