Accept/reject games (Q7018039)

This paper introduces a novel game-theoretic framework, called the \textbf{Accept/Reject game} (AR), as a new approach to studying classical topological selection principles. The authors successfully generalize existing selection games by defining and analyzing the game \(AR(\mathcal{A}, \mathcal{B})\) for families \(\mathcal{A}\) and \(\mathcal{B}\) of covers of a topological space.\N\NIn the AR game, Alice proposes open sets, and Bob chooses to either accept or reject them. Bob wins if the accepted subcollection belongs to \(\mathcal{B}\) or if the full sequence of proposals fails to be in \(\mathcal{A}\). Otherwise, Alice wins. The paper rigorously connects this game to established topological games like \(G_1(\mathcal{A}, \mathcal{B})\) and \(G_{\mathrm{fin}}(\mathcal{A}, \mathcal{B})\), showing how strategies and selection properties translate between them.\N\NA central contribution is the demonstration of equivalences between various properties under appropriate assumptions on the families \(\mathcal{A}\) and \(\mathcal{B}\), including countable thickness, finite stability, and tensorability. Particularly noteworthy is Theorem 2.12, which proves the equivalence of four key properties, including the AR game and \(S_1(\mathcal{A}, \Gamma)\), under strong structural assumptions on \(\mathcal{A}\).\N\NThe authors also extend their analysis to \(\omega\)-groupable covers, demonstrating the equivalence of the selection principle \(S_1(\Omega_{\mathrm{gp}}, \Gamma)\) with the property \((\Omega_{\mathrm{gp}}, \Gamma)\), solving an open problem in this domain. Furthermore, they define finitary versions of AR and show their equivalence to the classical \(G_1\) and \(G_{\mathrm{fin}}\) games.