The Random Graph Intuition for the Tournament Game
From MaRDI portal
Publication:5364264
DOI10.1017/S096354831500019XzbMath1371.05100arXiv1307.4229MaRDI QIDQ5364264
Heidi Gebauer, Dennis Clemens, Anita Liebenau
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.4229
Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (3)
A non-trivial upper bound on the threshold bias of the oriented-cycle game ⋮ A remark on the tournament game ⋮ Multistage positional games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A non-trivial upper bound on the threshold bias of the oriented-cycle game
- Biased orientation games
- On the clique-game
- The oriented cycle game
- Biased positional games and the phase transition
- The diameter game
- Asymptotic random graph intuition for the biased connectivity game
- Planarity, Colorability, and Minor Games
- Biased Positional Games
- Deterministic Graph Games and a Probabilistic Intuition
- Positional games on random graphs
- Combinatorial Games
- On a combinatorial game
- Biased positional games for which random strategies are nearly optimal
This page was built for publication: The Random Graph Intuition for the Tournament Game