TY - JOUR
T1 - Fast winning strategies in positional games
AU - Hefetz, Dan
AU - Krivelevich, Michael
AU - Stojaković, Miloš
AU - Szabó, Tibor
N1 - Funding Information:
1 Partly supported by USA-Israel BSF Grant 2002-133 and by grant 526/05 from the Israel Science Foundation. 2 Partly supported by Republic of Serbia, Ministry of Science and Environmental Protection. 3Email: [email protected], [email protected], [email protected], [email protected].
PY - 2007/8/15
Y1 - 2007/8/15
N2 - For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker's win, then set τM (H) = ∞). Similarly, for the unbiased Avoider-Enforcer game played on H, let τE (H) be the smallest integer t such that Enforcer can win the game within t moves (if the game is an Avoider's win, then set τM (E) = ∞). We investigate τM and τE and determine their value for various positional games.
AB - For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker's win, then set τM (H) = ∞). Similarly, for the unbiased Avoider-Enforcer game played on H, let τE (H) be the smallest integer t such that Enforcer can win the game within t moves (if the game is an Avoider's win, then set τM (E) = ∞). We investigate τM and τE and determine their value for various positional games.
KW - Avoider-Enforcer
KW - Maker-Breaker
KW - connectivity
KW - planarity
UR - https://www.scopus.com/pages/publications/34547731382
U2 - 10.1016/j.endm.2007.07.046
DO - 10.1016/j.endm.2007.07.046
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:34547731382
SN - 1571-0653
VL - 29
SP - 213
EP - 217
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
IS - SPEC. ISS.
ER -