Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/16099
Title: | Fast winning strategies in positional games | Authors: | Hefetz D. Krivelevich M. Stojaković, Miloš Szabó T. |
Issue Date: | 15-Aug-2007 | Journal: | Electronic Notes in Discrete Mathematics | Abstract: | 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. © 2007 Elsevier B.V. All rights reserved. | URI: | https://open.uns.ac.rs/handle/123456789/16099 | ISSN: | 15710653 | DOI: | 10.1016/j.endm.2007.07.046 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
1
checked on Sep 9, 2023
Page view(s)
10
Last Week
1
1
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.