Positional games

DOI10.1007/978-3-0348-0825-5zbMath1314.91003OpenAlexW4242601903MaRDI QIDQ2438527

Tibor Szabó, Miloš Stojaković, Dan Hefetz, Michael Krivelevich

Publication date: 5 March 2014

Published in: Oberwolfach Seminars (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-0348-0825-5

zbMATH Keywords

positional gamesmaker-breaker gamesavoider-enforcer games

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of game theory (91A80) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Positional games (pursuit and evasion, etc.) (91A24) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Graph designs and isomorphic decomposition (05C51)

Related Items (55)

Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Waiter-client and client-waiter colourability and \(k\)-SAT games ⋮ Creating cycles in walker-breaker games ⋮ Fast winning strategies for the maker-breaker domination game ⋮ New models of graph-bin packing ⋮ A new bound for the Maker-Breaker triangle game ⋮ Spanning Structures in Walker–Breaker Games ⋮ Strong Ramsey games: drawing on an infinite board ⋮ The threshold bias of the clique-factor game ⋮ How fast can maker win in fair biased games? ⋮ On the WalkerMaker-WalkerBreaker games ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Random-player maker-breaker games ⋮ Maker-breaker total domination game ⋮ Maker-Breaker total domination game on cubic graphs ⋮ The Kℵ0$K^{\aleph _0}$ game: Vertex colouring ⋮ Maker Breaker on digraphs ⋮ Random strategies are nearly optimal for generalized van der Waerden games ⋮ Winning fast in biased maker-breaker games ⋮ The maker-breaker largest connected subgraph game ⋮ \(\boldsymbol{H}\)-Games Played on Vertex Sets of Random Graphs ⋮ The maker-maker domination game in forests ⋮ Misère Tic-Tac-Toe on Projective Binary Steiner Triple Systems ⋮ Multistage positional games ⋮ The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Fast winning strategies for staller in the maker-breaker domination game ⋮ On the odd cycle game and connected rules ⋮ Fast strategies in Waiter-Client games ⋮ Finding and Using Expanders in Locally Sparse Graphs ⋮ Manipulative Waiters with Probabilistic Intuition ⋮ Thresholds for the monochromatic clique transversal game ⋮ The speed and threshold of the biased perfect matching and Hamilton cycle games ⋮ The cost of adaptivity in security games on graphs ⋮ A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals ⋮ Online Ramsey Numbers and the Subgraph Query Problem ⋮ Client-waiter games on complete and random graphs ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ Game saturation of intersecting families ⋮ Waiter-client triangle-factor game on the edges of the complete graph ⋮ Democratic fair allocation of indivisible goods ⋮ Connector-breaker games on random boards ⋮ Maker-breaker resolving game ⋮ Hamiltonian Maker–Breaker Games on Small Graphs ⋮ Ramsey, Paper, Scissors ⋮ On the separation conjecture in avoider-enforcer games ⋮ On the threshold for the Maker-BreakerH-game ⋮ Maker-breaker domination number ⋮ On the subgraph query problem ⋮ Maker-Breaker domination game ⋮ The toucher-isolator game ⋮ Waiter-client clique-factor game ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ On strong avoiding games ⋮ Waiter-client and client-waiter Hamiltonicity games on random graphs

This page was built for publication: Positional games