{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T06:11:55Z","timestamp":1773900715889,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In a $(1:b)$ Maker-Breaker game, one of the central questions is to find the maximal value of $b$ that allows Maker to win the game (that is, the critical bias $b^*$). Erd\u0151s conjectured that the critical bias for many Maker-Breaker games played on the edge set of $K_n$ is the same as if both players claim edges randomly. Indeed, in many Maker-Breaker games, \"Erd\u0151s Paradigm\" turned out to be true. Therefore, the next natural question to ask is the (typical) value of the critical bias for Maker-Breaker games where only one player claims edges randomly. A random-player Maker-Breaker\u00a0game is a two-player game, played the same as an ordinary (biased) Maker-Breaker\u00a0game, except that one player plays according to his best strategy and claims one element in each round, while the other plays randomly and claims $b$ (or $m$) elements. In fact, for every (ordinary) Maker-Breaker game, there are two different random-player versions; the $(1:b)$ random-Breaker game and the $(m:1)$ random-Maker game. We analyze the\u00a0random-player version of several classical Maker-Breaker games such as the\u00a0Hamilton cycle game, the perfect-matching game and the $k$-vertex-connectivity game (played on the edge set of $K_n$). For each of these games we find or estimate the asymptotic values of the bias (either $b$ or $m$) that allow each player to typically win the game. In fact, we provide the \"smart\" player with an explicit winning strategy for the corresponding value of the bias.<\/jats:p>","DOI":"10.37236\/5032","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:01:24Z","timestamp":1578697284000},"source":"Crossref","is-referenced-by-count":4,"title":["Random-Player Maker-Breaker games"],"prefix":"10.37236","volume":"22","author":[{"given":"Michael","family":"Krivelevich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gal","family":"Kronenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2015,10,16]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i4p9\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i4p9\/comment","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i4p9\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:09:14Z","timestamp":1579255754000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i4p9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,16]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,10,16]]}},"URL":"https:\/\/doi.org\/10.37236\/5032","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,16]]},"article-number":"P4.9"}}