A solution to the Box Game
From MaRDI portal
The authors give a complete solution to the Box Game introduced by \textit{V. Chvátal} and \textit{P. Erdős} [Ann. Discrete Math. 2, 221-229 (1978; Zbl 0374.90086)]. This is a two player game played on n pairwise disjoint nonempty sets \(A_ 1,...,A_ n\). At each of their moves the players, called the Maker and the Breaker, claim at most q resp. p elements from the sets. The objective of the Maker is to claim all elements from one of the \(A_ i's\), while the objective of the Breaker is to prevent him to succeed.
Recommendations
Cited in
(14)- A new upper bound on the game chromatic index of graphs
- Maker-breaker percolation games. II: Escaping to infinity
- Game edge-connectivity of graphs
- Box and ball system with numbered boxes
- Waiter-client and client-waiter Hamiltonicity games on random graphs
- Yahya Ould Hamidoune's mathematical journey: a critical review of his work
- Walker-breaker games
- scientific article; zbMATH DE number 4145120 (Why is no real title available?)
- Fast embedding of spanning trees in biased maker-breaker games
- scientific article; zbMATH DE number 4120174 (Why is no real title available?)
- The game chromatic number of dense random graphs
- Efficient winning strategies in random-turn maker-breaker games
- \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
- Asymptotic thresholds for (a: b) minimum-degree games
This page was built for publication: A solution to the Box Game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095050)