Efficient Winning Strategies in Random‐Turn Maker–Breaker Games. Issue 2 (20th July 2016)

• Record Type: Journal Article
• Authors: Ferber, Asaf; Krivelevich, Michael; Kronenberg, Gal
• Is Part Of: Journal of graph theory. Volume 85:Issue 2(2017)
• Page Start: 446
• Page End: 465
• Publication Date: 2016-07-20
• Subjects: positional games -- Maker‐Breaker games -- random graphs; Graph theory -- Periodicals; 511
• DOI: 10.1002/jgt.22072
• Languages: English
• ISSNs: 0364-9024

Abstract

Abstract: We consider random‐turn positional games, introduced by Peres, Schramm, Sheffield, and Wilson in 2007. A p ‐random‐turn positional game is a two‐player game, played the same as an ordinary positional game, except that instead of alternating turns, a coin is being tossed before each turn to decide the identity of the next player to move (the probability of Player I to move is p ). We analyze the random‐turn version of several classical Maker–Breaker games such as the game Box (introduced by Chvátal and Erdős in 1987), the Hamilton cycle game and the k ‐vertex‐connectivity game (both played on the edge set of K n ). For each of these games we provide each of the players with a (randomized) efficient strategy that typically ensures his win in the asymptotic order of the minimum value of p for which he typically wins the game, assuming optimal strategies of both players.