Biased Positional Games

DOI10.1016/S0167-5060(08)70335-2MaRDI QIDQ4152069zbMATH OpenOpenAlexFDO

Authors

Publication date 1978

Published in Algorithmic Aspects of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70335-2

Mathematics Subject Classification ID

2-person games (91A05)

Recommendations

• On Biased Positional Games
• Biased positional games on matroids
• Biased orientation games
• scientific article; zbMATH DE number 1354920
• Biased games on random boards
• scientific article; zbMATH DE number 3946179
• Biased positional games for which random strategies are nearly optimal
• Biased positional games and the phase transition

Cited in

(88)

• Component games on regular graphs
• Avoider-Enforcer games played on edge disjoint hypergraphs
• Maker-breaker games on random geometric graphs
• The random graph intuition for the tournament game
• Maker-breaker percolation games. II: Escaping to infinity
• Playing to retain the advantage
• Maker-Breaker games on randomly perturbed graphs
• On the WalkerMaker-WalkerBreaker games
• Van der Waerden and Ramsey type games
• Avoider-forcer games on hypergraphs with small rank
• Waiter-Client and Client-Waiter planarity, colorability and minor games
• The diameter game
• Multistage positional games
• A new upper bound on the game chromatic index of graphs
• Creating cycles in walker-breaker games
• Building spanning trees quickly in maker-breaker games
• On the odd cycle game and connected rules
• Fast embedding of spanning trees in biased maker-breaker games
• The picker-chooser diameter game
• The cordiality game and the game cordiality number
• Biased games on random boards
• Sharp thresholds for half-random games. I.
• A note on biased and non-biased games
• Biased positional games for which random strategies are nearly optimal
• Sharp thresholds for half-random games. II
• Avoider-enforcer: the rules of the game
• Biased positional games and the phase transition
• Winning fast in biased maker-breaker games
• Maker-Breaker total domination game on cubic graphs
• A threshold for the maker-breaker clique game
• Fast winning strategies in positional games
• A solution to the Box Game
• A new bound for the Maker-Breaker triangle game
• On strong avoiding games
• Maker Breaker on digraphs
• Directed switching games on graphs and matroids
• Biased positional games on matroids
• Fast strategies in Waiter-Client games
• Incidence, a Scoring Positional Game on Graphs
• Deterministic Graph Games and a Probabilistic Intuition
• On the separation conjecture in avoider-enforcer games
• A remark on the tournament game
• A Hamiltonian game on \(K_{n,n}\)
• Random-player maker-breaker games
• Global maker-breaker games on sparse graphs
• Manipulative waiters with probabilistic intuition
• Connector-breaker games on random boards
• Chasing the threshold bias of the 3-AP game
• Shutout games on graphs
• Fast strategies in maker-breaker games played on random boards
• Doubly biased walker-breaker games
• Generating random graphs in biased maker-breaker games
• The threshold bias of the clique-factor game
• Maker-breaker total domination game
• Keeping avoider's graph almost acyclic
• Walker-breaker games
• scientific article; zbMATH DE number 3946179 (Why is no real title available?)
• Variations on a game
• Maker–Breaker percolation games I: crossing grids
• Walker-breaker games on \(G_{n, p}\)
• Waiter-client and client-waiter Hamiltonicity games on random graphs
• Avoider-Enforcer games
• A non-trivial upper bound on the threshold bias of the oriented-cycle game
• Hamiltonian maker-breaker games on small graphs
• Biased orientation games
• Maker-Breaker domination game
• An Achievement Game on a Cycle
• Efficient winning strategies in random-turn maker-breaker games
• Fast winning strategies in maker-breaker games
• The game chromatic number of dense random graphs
• On the clique-game
• The maker-breaker largest connected subgraph game
• Random strategies are nearly optimal for generalized van der Waerden games
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Complexity of maker-breaker games on edge sets of graphs
• Hitting time results for maker-breaker games
• Avoider-Enforcer: the rules of the game
• Playing to retain the advantage
• The toucher-isolator game
• MAKER–BREAKER GAMES ON AND
• Local resilience and hamiltonicity maker-breaker games in random regular graphs
• The speed and threshold of the biased perfect matching and Hamilton cycle games
• Generalized pairing strategies -- a bridge from pairing strategies to colorings
• Spanning Structures in Walker–Breaker Games
• Remarks on positional games. I
• \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs
• Robust Hamiltonicity of Dirac graphs
• Graph Tilings in Incompatibility Systems

This page was built for publication: Biased Positional Games

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