Abstract
We study biased Maker-Breaker positional games between two players, one of whom is playing randomly against an opponent with an optimal strategy. In this work we focus on the case of Breaker playing randomly and Maker being “clever”. The reverse scenario is treated in a separate paper. We determine the sharp threshold bias of classical games played on the edge set of the complete graph \(K_n\), such as connectivity, perfect matching, Hamiltonicity, and minimum degree-1 and -2. In all of these games, the threshold is equal to the trivial upper bound implied by the number of edges needed for Maker to occupy a winning set. Moreover, we show that CleverMaker can not only win against asymptotically optimal bias, but can do so very fast, wasting only logarithmically many moves (while the winning set sizes are linear in n).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barát, J., Stojakovic, M.: On winning fast in Avoider–Enforcer games. Electron. J. Comb. 17(1), R56 (2010)
Chvátal, V., Erdős, P.: Biased positional games. Ann. Discret. Math. 2, 221–228 (1978)
Erdős, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5, 17–61 (1960)
Ferber, A., Hefetz, D.: Winning strong games through fast strategies for weak games. Electron. J. Comb. 18(1), P144 (2011)
Ferber, A., Hefetz, D.: Weak and strong k-connectivity games. Eur. J. Comb. 35(1), 169–183 (2014)
Gebauer, H., Szabó, T.: Asymptotic random graph intuition for the biased connectivity game. Random Struct. Algorithms 35(4), 431–443 (2009)
Groschwitz, J.: Thresholds in Half-Random Graph Games. Freie Universität Berlin, Berlin (2014)
Groschwitz, J., Szabó, T.: Thresholds for half-random games I (2015). arXiv:1507.06688
Hefetz, D., Krivelevich, M., Stojaković, M., Szabó, T.: Fast winning strategies in Avoider–Enforcer games. Gr. Comb. 25(4), 533–544 (2009)
Hefetz, D., Krivelevich, M., Stojaković, M., Szabó, T.: Fast winning strategies in Maker-Breaker games. J. Comb. Theory Ser. B 99(1), 39–47 (2009)
Hefetz, D., Stich, S.: On two problems regarding the Hamilton cycle game. Electron. J. Comb. 16(1), R28 (2009)
Krivelevich, M.: The critical bias for the Hamiltonicity game is (1+o(1))n/ln n. J. Am. Math. Soc. 24(1), 125–131 (2011)
Krivelevich, M., Kronenberg, G.: Random-player Maker-Breaker games. Electron. J. Comb. 22(4), P4.9 (2015)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Groschwitz, J., Szabó, T. Sharp Thresholds for Half-Random Games II. Graphs and Combinatorics 33, 387–401 (2017). https://doi.org/10.1007/s00373-016-1753-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-016-1753-4