Coding strategies, the Choquet game, and domain representability (Q260593)

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.