A remark on the tournament game
zbMATH Open1323.05089arXiv1503.02885MaRDI QIDQ888601FDOQ888601
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Biased Positional Games
- Combinatorial Games
- On a combinatorial game
- Biased positional games for which random strategies are nearly optimal
- Positional games on random graphs
- The random graph intuition for the tournament game
- A threshold for the maker-breaker clique game
Cited In (4)
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)