Playing to retain the advantage

DOI10.1017/S0963548310000064MaRDI QIDQ4933596zbMATH OpenFDO

Authors Noga Alon, Dan Hefetz, Michael Krivelevich

Publication date 14 October 2010

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Playing to retain the advantage
• On the threshold for the maker-breaker \(H\)-game
• A threshold for the maker-breaker clique game
• Biased positional games for which random strategies are nearly optimal
• A threshold for the maker-breaker clique game

Cites work

• A Solution of the Shannon Switching Game
• Biased Positional Games
• Biased positional games for which random strategies are nearly optimal
• Edge-Disjoint Spanning Trees of Finite Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Planarity, Colorability, and Minor Games
• Remarks on positional games. I

Cited in

(8)

• Playing against no-regret players
• Maker-Breaker games on randomly perturbed graphs
• Shutout games on graphs
• Surplus of Graphs and the Lovász Local Lemma
• Global maker-breaker games on sparse graphs
• The maker-breaker largest connected subgraph game
• Playing to retain the advantage
• The biased odd cycle game

This page was built for publication: Playing to retain the advantage

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