Variations on a Game of Gale (I): Coding Strategies

Scheepers, Marion

J. Symbolic Logic, Tome 58 (1993) no. 1, p. 1035-1043 / Harvested from Project Euclid

Résumé

We consider an infinite two-person game. The second player has a winning perfect information strategy; we show that this player has a winning strategy which depends on substantially less information. The game studied here is a variation on a game of Gale.

Publié le : 1993-09-14
Classification:

@article{1183744311,
     author = {Scheepers, Marion},
     title = {Variations on a Game of Gale (I): Coding Strategies},
     journal = {J. Symbolic Logic},
     volume = {58},
     number = {1},
     year = {1993},
     pages = { 1035-1043},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183744311}
}

Scheepers, Marion. Variations on a Game of Gale (I): Coding Strategies. J. Symbolic Logic, Tome 58 (1993) no. 1, pp.  1035-1043. http://gdmltest.u-ga.fr/item/1183744311/