Article contents
Covering Games and the Banach-Mazur Game: K-tactics
Published online by Cambridge University Press: 20 November 2018
Abstract
Given a free ideal J of subsets of a set X, we consider games where player ONE plays an increasing sequence of elements of the σ-completion of J, and player TWO tries to cover the union of this sequence by playing one set at a time from J. We describe various conditions under which player TWO has a winning strategy that uses only information about the most recent k moves of ONE, and apply some of these results to the Banach-Mazurgame.
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1993
References
- 5
- Cited by