Winning fast in fair biased maker-breaker games

DOI10.1016/J.ENDM.2015.06.048zbMATH Open1346.05186OpenAlexW2172422716MaRDI QIDQ322263FDOQ322263

Authors: Dennis Clemens, Mirjana Mikalački 

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.048

Recommendations

• How fast can maker win in fair biased games?
• Winning fast in biased maker-breaker games
• Fast strategies in biased Maker-Breaker games
• Fast winning strategies in maker-breaker games
• The speed and threshold of the biased perfect matching and Hamilton cycle games

zbMATH Keywords

maker-breaker gamesbiased gamesfast strategystrong games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites Work

• Combinatorial Games
• A Solution of the Shannon Switching Game
• On two problems regarding the Hamiltonian cycle game
• Weak and strong \(k\)-connectivity games
• Fast winning strategies in maker-breaker games
• The diameter game
• Doubly biased maker-breaker connectivity game
• Winning strong games through fast strategies for weak games

Cited In (13)

• On the WalkerMaker-WalkerBreaker games
• On winning fast in Avoider-Enforcer games
• Winning fast in biased maker-breaker games
• Fast strategies in biased Maker-Breaker games
• Maker Breaker on digraphs
• PathWalker-Breaker games on complete bipartite graphs
• Shutout games on graphs
• Fast strategies in maker-breaker games played on random boards
• Winning strong games through fast strategies for weak games
• Weak and strong \(k\)-connectivity games
• Fast winning strategies in maker-breaker games
• Complexity of maker-breaker games on edge sets of graphs
• How fast can maker win in fair biased games?

This page was built for publication: Winning fast in fair biased maker-breaker games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322263)