Type: Article
Publication Date: 1993-12-01
Citations: 7
DOI: https://doi.org/10.4153/cjm-1993-051-4
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.