Maker–Breaker percolation games I: crossing grids

DOI10.1017/S0963548320000097zbMath1466.05133arXiv1810.05190OpenAlexW3134132659MaRDI QIDQ4993258

Victor Falgas-Ravry, A. Nicholas Day

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

percolation theorytwo-player positional game

Mathematics Subject Classification ID

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

Related Items (2)

Maker-breaker percolation games. II: Escaping to infinity ⋮ Search for an immobile hider on a stochastic network

Cites Work

• Unnamed Item
• Unnamed Item
• The critical probability of bond percolation on the square lattice equals 1/2
• Maker-breaker percolation games. II: Escaping to infinity
• Hex and combinatorics
• Biased positional games and the phase transition
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Percolation
• Remarks on positional games. I
• Biased Positional Games
• Deterministic Graph Games and a Probabilistic Intuition
• Positional games on random graphs
• Strategies for the Shannon Switching Game
• On the optimality of the uniform random strategy
• Combinatorial Games
• A Solution of the Shannon Switching Game
• Self-avoiding walks crossing a square
• On a combinatorial game
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: Maker–Breaker percolation games I: crossing grids