Construct · 1 fields · 1 citations

Gale-Stewart theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Game theory

theorem that infinite two-player games of perfect information with an open winning set are determined, so one player has a winning strategy.

In game theory, Gale-Stewart theorem refers to theorem that infinite two-player games of perfect information with an open winning set are determined, so one player has a winning strategy. This meaning comes from Gale (1953) in Contributions to the Theory of Games (AM-28), Volume II.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Gale-Stewart theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

game2 fields · 3 citationsjingle · one word, two constructs information4 fields · 5 citationsjingle · one word, four constructs strategy4 fields · 4 citationsjingle · one word, four constructs

References

Gale, D., & Stewart, F. M. (1953). 13. Infinite Games with Perfect Information. In Contributions to the Theory of Games (AM-28), Volume II (pp. 245-266). Princeton University Press. https://doi.org/10.1515/9781400881970-014

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct