Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T00:36:14.712Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  12 March 2014

Marion Scheepers*
Affiliation:
Department of Mathematics, Boise State University, Boise, Idaho 83725

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
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