Fast strategies in biased Maker-Breaker games
From MaRDI portal
Publication:4560259
zbMATH Open1418.91089arXiv1602.04985MaRDI QIDQ4560259FDOQ4560259
Authors: Mirjana Mikalački, Miloš Stojaković
Publication date: 10 December 2018
Abstract: We study the biased Maker--Breaker positional games, played on the edge set of the complete graph on vertices, . Given Breaker's bias , possibly depending on , we determine the bounds for the minimal number of moves, depending on , in which Maker can win in each of the two standard graph games, the Perfect Matching game and the Hamilton Cycle game.
Full work available at URL: https://arxiv.org/abs/1602.04985
Recommendations
Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46)
Cited In (17)
- The biased odd cycle game
- Multistage positional games
- Biased positional games and small hypergraphs with large covers
- On winning fast in Avoider-Enforcer games
- Creating cycles in walker-breaker games
- Winning fast in biased maker-breaker games
- Fast winning strategies in positional games
- Fast strategies in Waiter-Client games
- Biased positional games on matroids
- Winning fast in fair biased maker-breaker games
- Maker-breaker resolving game
- Biased orientation games
- Fast winning strategies in maker-breaker games
- A strategy for isolator in the toucher-isolator game on trees
- Complexity of maker-breaker games on edge sets of graphs
- The speed and threshold of the biased perfect matching and Hamilton cycle games
- How fast can maker win in fair biased games?
This page was built for publication: Fast strategies in biased Maker-Breaker games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560259)