A non-trivial upper bound on the threshold bias of the Oriented-cycle game
From MaRDI portal
Publication:5419990
zbMath1293.05221arXiv1404.4529MaRDI QIDQ5419990
Anita Liebenau, Dennis Clemens
Publication date: 11 June 2014
Full work available at URL: https://arxiv.org/abs/1404.4529
2-person games (91A05) Games involving graphs (91A43) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57)
This page was built for publication: A non-trivial upper bound on the threshold bias of the Oriented-cycle game