Coding strategies, the Choquet game, and domain representability (Q260593)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Coding strategies, the Choquet game, and domain representability |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coding strategies, the Choquet game, and domain representability |
scientific article |
Statements
Coding strategies, the Choquet game, and domain representability (English)
0 references
21 March 2016
0 references
Let \(X\) be a regular space. In the paper under review, the author proves that if the NONEMPTY player has a winning strategy in the strong Choquet game \(\mathrm{Ch}(X)\) then NONEMPTY has a winning coding strategy in \(\mathrm{Ch}(X)\) (a strategy that depends only on the opponent's previous move and the NONEMPTY's own previous move). She proves also that any regular domain representable space is generalized subcompact.
0 references
domain representable
0 references
subcompact
0 references
Choquet game
0 references
Banach-Mazur game
0 references
