Combinatorial Games

DOI10.1017/CBO9780511735202zbMath1196.91002OpenAlexW4230867389WikidataQ56428687 ScholiaQ56428687MaRDI QIDQ5386139

Publication date: 18 April 2008

Full work available at URL: https://doi.org/10.1017/cbo9780511735202

Ramsey theory zero-sum game backward induction potential function perfect information game combinatorial game winning strategy optimal play backtracking algorithm Erdős theory

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Ramsey theory (05D10) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46)

Related Items

Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Picker-chooser fixed graph games ⋮ Waiter-client and client-waiter colourability and $k$-SAT games ⋮ The graph distance game and some graph operations ⋮ Creating cycles in walker-breaker games ⋮ Fast winning strategies for the maker-breaker domination game ⋮ Fast Strategies In Maker–Breaker Games Played on Random Boards ⋮ Economical extremal hypergraphs for the Erdős-Selfridge theorem ⋮ New models of graph-bin packing ⋮ Fast winning strategies in avoider-enforcer games ⋮ An $n$-in-a-row type game ⋮ Hitting time results for Maker-Breaker games ⋮ Winning fast in fair biased maker-breaker games ⋮ Spanning Structures in Walker–Breaker Games ⋮ A non-trivial upper bound on the threshold bias of the oriented-cycle game ⋮ A threshold for the Maker-Breaker clique game ⋮ The Maximum Number of Appearances of a Word in a Grid ⋮ Strong Ramsey games: drawing on an infinite board ⋮ Chasing the Threshold Bias of the 3-AP Game ⋮ Disproof of the neighborhood conjecture with implications to SAT ⋮ Transitive avoidance games on boards of odd size ⋮ How fast can maker win in fair biased games? ⋮ Walker-Breaker Games ⋮ On the WalkerMaker-WalkerBreaker games ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Avoider-Enforcer games played on edge disjoint hypergraphs ⋮ A remark on the tournament game ⋮ Random-player maker-breaker games ⋮ Maker-breaker total domination game ⋮ Global maker-breaker games on sparse graphs ⋮ Maker-Breaker total domination game on cubic graphs ⋮ Impartial hypergraph games ⋮ The Kℵ0$K^{\aleph _0}$ game: Vertex colouring ⋮ Proper 2-coloring game on some trees ⋮ Avoider-forcer games on hypergraphs with small rank ⋮ The topology of competitively constructed graphs ⋮ Fast winning strategies in positional games ⋮ Random strategies are nearly optimal for generalized van der Waerden games ⋮ Winning fast in biased maker-breaker games ⋮ $\boldsymbol{H}$-Games Played on Vertex Sets of Random Graphs ⋮ Hamilton cycles in highly connected and expanding graphs ⋮ The maker-maker domination game in forests ⋮ Misère Tic-Tac-Toe on Projective Binary Steiner Triple Systems ⋮ Biased orientation games ⋮ Multistage positional games ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Fast strategies in Waiter-Client games ⋮ Fast embedding of spanning trees in biased maker-breaker games ⋮ The Random Graph Intuition for the Tournament Game ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ On the clique-game ⋮ Unnamed Item ⋮ Upper bounds on positional Paris-Harrington games ⋮ Online Ramsey Numbers and the Subgraph Query Problem ⋮ Maker-breaker percolation games. II: Escaping to infinity ⋮ Client-waiter games on complete and random graphs ⋮ Generalized pairing strategies -- a bridge from pairing strategies to colorings ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ Strong games played on random graphs ⋮ Tic-Tac-Toe on an Affine Plane of order 4 ⋮ Game saturation of intersecting families ⋮ Transitive avoidance games ⋮ Avoider-enforcer: the rules of the game ⋮ Robust Hamiltonicity of Dirac graphs ⋮ Keeping avoider's graph almost acyclic ⋮ A sharp threshold for the Hamilton cycle Maker–Breaker game ⋮ Weak and strong $k$-connectivity games ⋮ Waiter-client triangle-factor game on the edges of the complete graph ⋮ The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛 ⋮ Fast winning strategies in maker-breaker games ⋮ An Achievement Game on a Cycle ⋮ The pairing strategies of the 9-in-a-row game ⋮ Unnamed Item ⋮ On solving the 7,7,5-game and the 8,8,5-game ⋮ On the separation conjecture in avoider-enforcer games ⋮ The Lovász Local Lemma and Satisfiability ⋮ Maker-breaker domination number ⋮ Maker-Breaker domination game ⋮ Maker–Breaker percolation games I: crossing grids ⋮ Fraternal augmentations, arrangeability and linear Ramsey numbers ⋮ The toucher-isolator game ⋮ Unnamed Item ⋮ Book Review: Inevitable randomness in discrete mathematics ⋮ Avoider-Enforcer: The Rules of the Game ⋮ Waiter-client clique-factor game ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Unnamed Item ⋮ Biased games on random boards ⋮ On strong avoiding games ⋮ The star avoidance game ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs