Biased positional games for which random strategies are nearly optimal
From MaRDI portal
Publication:5932750
DOI10.1007/s004930070002zbMath0973.91013OpenAlexW2036133666WikidataQ105584591 ScholiaQ105584591MaRDI QIDQ5932750
Małgorzata Bednarska, Tomasz Łuczak
Publication date: 13 June 2001
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930070002
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (40)
Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Picker-chooser fixed graph games ⋮ Creating cycles in walker-breaker games ⋮ Fast winning strategies for the maker-breaker domination game ⋮ A new bound for the Maker-Breaker triangle game ⋮ Generating random graphs in biased Maker-Breaker games ⋮ A threshold for the Maker-Breaker clique game ⋮ The threshold bias of the clique-factor game ⋮ A remark on the tournament game ⋮ Random-player maker-breaker games ⋮ Maker-breaker total domination game ⋮ Sharp thresholds for half-random games I ⋮ Avoider-forcer games on hypergraphs with small rank ⋮ Random strategies are nearly optimal for generalized van der Waerden games ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ Biased orientation games ⋮ Multistage positional games ⋮ On the odd cycle game and connected rules ⋮ Fast strategies in Waiter-Client games ⋮ The Random Graph Intuition for the Tournament Game ⋮ Maker-breaker percolation games. II: Escaping to infinity ⋮ Client-waiter games on complete and random graphs ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ Game chromatic index of graphs with given restrictions on degrees ⋮ Keeping avoider's graph almost acyclic ⋮ Positional games on random graphs ⋮ The picker-chooser diameter game ⋮ Playing to Retain the Advantage ⋮ The diameter game ⋮ Connector-breaker games on random boards ⋮ Fast winning strategies in maker-breaker games ⋮ On the separation conjecture in avoider-enforcer games ⋮ On the threshold for the Maker-BreakerH-game ⋮ Optimal threshold for a random graph to be 2-universal ⋮ Maker-breaker domination number ⋮ Maker–Breaker percolation games I: crossing grids ⋮ On chooser-picker positional games ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Efficient Winning Strategies in Random‐Turn Maker–Breaker Games ⋮ Probabilistic intuition holds for a class of small subgraph games
This page was built for publication: Biased positional games for which random strategies are nearly optimal
