Abstract
We study a family of infinite games with imperfect information introduced by B. Model for two players that alternately remove and add points to a finite set. We investigate the existence of imperfect information strategies for the remover for different ambient cardinalities. We also study a variant of a game of D. Gale introduced by Scheepers and Weiss.
Similar content being viewed by others
References
P. Erdős, A. Hajnal, A. Matè and R. Rado, Combinatorial Set Theory: Partition Relations for Cardinals, North-Holland, Amsterdam, 1984.
K. Ciesielski and R. Laver, A game of D. Gale in which one of the players has limited memory, Periodica Mathematica Hungarica 22 (1990), 153–158.
B. I. Model, Elements of the Theory of Multistep Processes of Sequential Decision Making (in Russian), Nauka, Moscow, 1985.
B. I. Model, Games of search and completion, Journal of Mathematical Sciences 80 (1996), 1699–1744.
M. Scheepers, Variations on a game of Gale (I): Coding strategies, The Journal of Symbolic Logic 58 (1993), 1035–1043.
M. Scheepers, Variations on a game of Gale (II): Markov strategies, Theoretical Computer Science 129 (1994), 385–396.
M. Scheepers and W. Weiss, Variations on a game of Gale (III): Remainder strategies, The Journal of Symbolic Logic 62 (1997), 1253–1264.
Author information
Authors and Affiliations
Additional information
Work supported by the Ben-Gurion University Center for Advanced Studies in Mathematics.
Rights and permissions
About this article
Cite this article
Abraham, U., Schipperus, R. Infinite games on finite sets. Isr. J. Math. 159, 205–219 (2007). https://doi.org/10.1007/s11856-007-0043-5
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11856-007-0043-5