相关论文: On the companion of spaces having dense, relativel…

The primary objective of this work is to construct spaces that are "pseudocompact but not countably compact," abbreviated as PNC, while endowing them with additional properties. First, motivated by an old problem of van Douwen, we construct…

Let S be a topological property of sequences (such as, for example, "to contain a convergent subsequence" or "to have an accumulation point"). We introduce the following open-point game OP(X,S) on a topological space X. In the n'th move,…

A novel selection principle was introduced by Dorantes-Aldama and Shakhmatov: a topological space $X$ is termed {\em selectively pseudocompact} if for any sequence $(U_n:n\in {\omega})$ of pairwise disjoint non-empty open sets of $X$, one…

In this paper, we give a topological version of Scott convergence theorem for locally hypercompact spaces. We introduce the notion of $\mathcal{S}^*_X$-convergence on a $T_0$ topological space $X$, and define the notion of finitely…

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…

Discrete reinforcement learning (RL) algorithms have demonstrated exceptional performance in solving sequential decision tasks with discrete action spaces, such as Atari games. However, their effectiveness is hindered when applied to…

In this note, we compare and contrast various selective divergence properties such as the properties of being discretely selective and selectively highly divergent. We identify and incorporate a class of subsemigroups of the semigroup of…

We say that a topological space X is selectively sequentially pseudocompact (SSP for short) if for every sequence (U_n) of non-empty open subsets of X, one can choose a point x_n in U_n for every n in such a way that the sequence (x_n) has…

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)$.…

Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. There are different ways of weakening a definition of Nash-like equilibrium in order to guarantee the existence of a weakened equilibrium.…

It is an interesting, maybe surprising, fact that different dense subspaces of even "nice" topological spaces can have different densities. So, our aim here is to investigate the set of densities of all dense subspaces of a topological…

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…

Self-play (SP) is a popular multi-agent reinforcement learning (MARL) framework for solving competitive games, where each agent optimizes policy by treating others as part of the environment. Despite the empirical successes, the theoretical…

The radius-$r$ splitter game is played on a graph $G$ between two players: Splitter and Connector. In each round, Connector selects a vertex $v$, and the current game arena is restricted to the radius-$r$ neighborhood of $v$. Then Splitter…

Value methods for solving stochastic games with partial observability model the uncertainty about states of the game as a probability distribution over possible states. The dimension of this belief space is the number of states. For many…

A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…

We study the complexity of equilibrium computation in discrete preference games. These games were introduced by Chierichetti, Kleinberg, and Oren (EC '13, JCSS '18) to model decision-making by agents in a social network that choose a…

Semidefinite programs (SDPs) often arise in relaxations of some NP-hard problems, and if the solution of the SDP obeys certain rank constraints, the relaxation will be tight. Decomposition methods based on chordal sparsity have already been…

Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications between $\Pi^1_2$ principles over $\omega$-models of…

A special sorting operation called Context Directed Swap, and denoted \textbf{cds}, performs certain types of block interchanges on permutations. When a permutation is sortable by \textbf{cds}, then \textbf{cds} sorts it using the fewest…