Abstract
AbstractWe 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.
Publisher
Cambridge University Press (CUP)
Reference4 articles.
1. Meager-nowhere dense games (II): coding strategies;Scheepers;Proceedings of the American Mathematical Society,1991
2. A game of D. Gale in which one of the players has limited memory
3. A ramseyan theorem and an infinite game
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Infinite games on finite sets;Israel Journal of Mathematics;2007-06
2. Infinitely Complex Machines;Intelligent Computing Everywhere;2007
3. Supermachines and superminds;Minds and Machines;2003