{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:22Z","timestamp":1753893862435,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We study the Maker-Breaker tournament game played on the edge set of a given graph $G$. Two players, Maker and Breaker, claim unclaimed edges of $G$ in turns, while Maker additionally assigns orientations to the edges that she claims. If by the end of the game Maker claims all the edges of a pre-defined goal tournament, she wins the game. Given a tournament $T_k$ on $k$ vertices, we determine the threshold bias for the $(1:b)$ $T_k$-tournament game on $K_n$. We also look at the $(1:1)$ $T_k$-tournament game played on the edge set of a random graph ${\\mathcal{G}_{n,p}}$ and determine the threshold probability for Maker's win. We compare these games with the clique game and discuss whether a random graph intuition is satisfied.\u00a0<\/jats:p>","DOI":"10.37236\/5142","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:25:48Z","timestamp":1578669948000},"source":"Crossref","is-referenced-by-count":0,"title":["A Remark on the Tournament Game"],"prefix":"10.37236","volume":"22","author":[{"given":"Dennis","family":"Clemens","sequence":"first","affiliation":[]},{"given":"Mirjana","family":"Mikala\u010dki","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2015,9,20]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i3p42\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i3p42\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:12:44Z","timestamp":1579255964000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i3p42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,20]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2015,7,1]]}},"URL":"https:\/\/doi.org\/10.37236\/5142","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2015,9,20]]},"article-number":"P3.42"}}