The Maker-Breaker percolation game on the square lattice

Abstract: We study the

(m, b)

Maker-Breaker percolation game on

m a t h b b Z^{2}

, introduced by Day and Falgas-Ravry. As our first result, we show that Breaker has a winning strategy for the

(m, b)

-game whenever

b g e q (2 - f r a c 114 + o (1)) m

, breaking the ratio

2

barrier proved by Day and Falgas-Ravry. Addressing further questions of Day and Falgas-Ravry, we show that Breaker can win the

(m, 2 m)

-game even if he allows Maker to claim

c

edges before the game starts, for any integer

c

, and that he can moreover win rather fast (as a function of

c

). Finally, we consider the game played on

m a t h b b Z^{2}

after the usual bond percolation process with parameter

p

was performed. We show that when

p

is not too much larger than

1 / 2

, Breaker almost surely has a winning strategy for the

(1, 1)

-game, even if Maker is allowed to choose the origin after the board is determined.

This page was built for publication: The Maker-Breaker percolation game on the square lattice