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

Journal of Symbolic Logic 58 (3):1035-1043 (1993)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,928

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
44 (#361,366)

6 months
16 (#156,797)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Supermachines and superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.

Add more citations

References found in this work

No references found.

Add more references