Hostname: page-component-7dd5485656-s6l46 Total loading time: 0 Render date: 2025-10-31T18:37:33.147Z Has data issue: false hasContentIssue false
  • English
  • Français

Variations on a game of Gale (I): Coding strategies

Published online by Cambridge University Press:  12 March 2014

Marion Scheepers
Marion Scheepers*
Affiliation:
Department of Mathematics, Boise State University, Boise, Idaho 83725
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 58 , Issue 3 , September 1993 , pp. 1035 - 1043
Copyright
Copyright © Association for Symbolic Logic 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[C-L]Cieslelski, K. and Laver, R., A game of D. Gale in which one of the players has limited memory, Periodica Mathematica Hungarica, vol. 22 (1990), pp. 153–158.CrossRefGoogle Scholar
[G-S]Galvin, F. and Scheepers, M., A Ramseyan theorem and an infinite game, Journal of Combinatorial Theory Series A, vol. 59 (1992), pp. 125–129.CrossRefGoogle Scholar
[E-H-M-R]Erdös, P., Hajnal, A., Mate, A., Rado, R., Combinatorial set theory: partition relations for cardinals, North-Holland, Amsterdam, 1984.Google Scholar
[S]Scheepers, M., Meager-nowhere dense games (II): coding strategies, Proceedings of the American Mathematical Society, vol. 112 (1991), pp. 1107–1115.Google Scholar