A remark on the tournament game

MaRDI QIDQ888601zbMATH OpenFDO

Authors Dennis Clemens, Mirjana Mikalački

Publication date 2 November 2015

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.02885, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i3p42

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

positional gamestournamentmaker-breaker

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Abstract: 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, and Maker wins if by the end of the game she claims all the edges of a pre-defined goal tournament. 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.

Recommendations

• A remark on the game ``Battle of the sexes
• The nature of tournaments
• Some remarks on simple tournaments
• Tournament games and positive tournaments
• scientific article; zbMATH DE number 4043867
• Note on eccentricities in tournaments
• A Problem on Tournaments
• A tournament problem
• On scores in tournaments

Cites work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A threshold for the maker-breaker clique game
• Biased Positional Games
• Biased positional games for which random strategies are nearly optimal
• Combinatorial Games
• On a combinatorial game
• Positional games on random graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The random graph intuition for the tournament game

Cited in

(4)

• The random graph intuition for the tournament game
• A remark on a helicopter and submarine game
• Biased orientation games
• On the clique-game

This page was built for publication: A remark on the tournament game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888601)