相关论文: On strategies for selection games related to count…

We characterize countable dimensionality and strong countable dimensionality by means of an infinite game.

Game-theoretic characterizations of selection principles provide a powerful framework for analyzing covering properties through strategic interactions. For a Tychonoff space $X$ and a non-trivial metrizable arc-connected topological group…

In this paper, we defined two new games - the mildly Menger game and the compact-clopen game. In a zero-dimensional space, the Menger game is equivalent to the mildly Menger game and the compact-open game is equivalent to the compact-clopen…

In this paper we study the selection principle of closed discrete selection, first researched by Tkachuk in [13] and strengthened by Clontz, Holshouser in [3], in set-open topologies on the space of continuous real-valued functions.…

We establish relationships between various topological selection games involving the space of minimal usco maps with various topologies, including the topology of pointwise convergence and the topology of uniform convergence on compact…

By adapting techniques of Arhangel'skii, Barman, and Dow, we may equate the existence of perfect-information, Markov, and tactical strategies between two interesting selection games. These results shed some light on Gruenhage's question…

We establish relationships between various topological selection games involving the space of minimal cusco maps into the real line and the underlying domain. These connections occur across different topologies, including the topology of…

We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.e., measurable set of infinite plays), such as reachability,…

By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form…

Selective versions of screenability and of strong screenability coincide in a large class of spaces. We show that the corresponding games are not equivalent in even such standard metric spaces as the closed unit interval. We identify…

We provide several tests to determine whether a game is a potential game or whether it is a zero-sum equivalent game---a game which is strategically equivalent to a zero-sum game in the same way that a potential game is strategically…

In 2017, Tkachuk isolated the closed discrete selection property while working on problems related to function spaces [15]. In this paper we will study the closed discrete selection property and the related games and strategies on $C_k(X)$.…

In this paper we connect selection principles on a topological space to corresponding selection principles on one of its hyperspaces. We unify techniques and generalize theorems from the known results about selection principles for common…

The remoteness from a simple game to a weighted game can be measured by the concept of the dimension or the more general Boolean dimension. It is known that both notions can be exponential in the number of voters. For complete simple games…

We apply the theory of infinite two-person games to two well-known problems in topology: Suslin's Problem and Arhangel'skii's problem on $G_\delta$ covers of compact spaces. More specifically, we prove results of which the following two are…

We examine the class of spaces in which the second player has a winning strategy in the open--open game. We show that this spaces are not universally Kuratowski-Ulam. We also show that the games G and G7 introduced by P. Daniels, K. Kunen,…

For a Tychonoff space $X$, we denote by $(C(X), \tau_k, \tau_p)$ the bitopological space of all real-valued continuous functions on $X$ where $\tau_k$ is the compact-open topology and $\tau_p$ is the topology of pointwise convergence. In…

The principle of open determinacy for class games---two-player games of perfect information with plays of length $\omega$, where the moves are chosen from a possibly proper class, such as games on the ordinals---is not provable in…

We study transfinite cut-and-choose games on $T_0$ spaces, introducing the {\em point-separating number} $ps(X)$ and the {\em set membership number} ${sm}(X)$ as the ordinal-valued invariants measuring the minimal length of a game in which…

We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent. The part of this characterisation that…