A remark on the Tournament game
Dennis Clemens, Mirjana Mikala\v{c}ki

TL;DR
This paper investigates the Maker-Breaker tournament game on graphs, establishing thresholds for Maker's win in both complete and random graphs, and compares these results with the clique game to analyze underlying intuitions.
Contribution
It determines the threshold bias for the tournament game on complete graphs and the threshold probability on random graphs, providing new insights into positional game strategies.
Findings
Threshold bias for Maker's win on $K_n$ is established.
Threshold probability for Maker's win on ${ m f G}_{n,p}$ is identified.
Comparison with the clique game reveals insights into random graph intuition.
Abstract
We study the Maker-Breaker tournament game played on the edge set of a given graph . Two players, Maker and Breaker claim unclaimed edges of 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 on vertices, we determine the threshold bias for the -tournament game on . We also look at the -tournament game played on the edge set of a random graph 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Complex Network Analysis Techniques · Complexity and Algorithms in Graphs
