Covering games and the Banach-Mazur game: k-tactics
Logic
2009-09-25 v1
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 sigma completion of J, and 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 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-Mazur game.
Cite
@article{arxiv.math/9207203,
title = {Covering games and the Banach-Mazur game: k-tactics},
author = {Tomek Bartoszynski and Winfried Just and Marion Scheepers},
journal= {arXiv preprint arXiv:math/9207203},
year = {2009}
}