Article contents
WINNING AN INFINITE COMBINATION OF GAMES
Published online by Cambridge University Press: 24 February 2012
Abstract
We introduce a precise framework for transferring strategies from simpler to more complex games, and use it to construct strategies in certain finite and infinite combinations of games. In particular, we give a finitary characterization of finite hypergraphs X such that the first player can win the positional game on infinitely many copies of X. This resolves a conjecture of Leader.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © University College London 2012
References
- 2
- Cited by