Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)

 

 

Meager-nowhere dense games. II. Coding strategies


Author: Marion Scheepers
Journal: Proc. Amer. Math. Soc. 112 (1991), 1107-1115
MSC: Primary 04A20; Secondary 54H99, 90D05, 90D44
MathSciNet review: 1072348
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We consider three closely related infinite two person games in which the second player has a winning perfect information strategy and examine under what conditions it suffices for the second player to remember only the most recent two moves in the game in order to insure a win. Strategies depending on this information only are called coding strategies.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 04A20, 54H99, 90D05, 90D44

Retrieve articles in all journals with MSC: 04A20, 54H99, 90D05, 90D44


Additional Information

DOI: http://dx.doi.org/10.1090/S0002-9939-1991-1072348-6
Keywords: Free ideal, game, winning strategy, coding strategy
Article copyright: © Copyright 1991 American Mathematical Society