Playing to retain the advantage

DOI10.1017/S0963548310000064zbMATH Open1198.05112MaRDI QIDQ4933596FDOQ4933596

Michael Krivelevich, Dan Hefetz, Noga Alon

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)

Cites Work

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

Cited In (5)

• The biased odd cycle game
• Playing against no-regret players
• Global maker-breaker games on sparse graphs
• Maker-Breaker Games on Randomly Perturbed Graphs
• The maker-breaker largest connected subgraph game

   Recommendations

• Playing to retain the advantage 👍 👎
• On the threshold for the maker-breaker \(H\)-game 👍 👎
• Title not available (Why is that?) 👍 👎
• Biased positional games for which random strategies are nearly optimal 👍 👎
• A threshold for the maker-breaker clique 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)