Related papers: On Ramsey properties, function spaces, and topolog…
If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…
We show that it is decidable whether two regular languages of infinite trees are separable by a deterministic language, resp., a game language. We consider two variants of separability, depending on whether the set of priorities of the…
We consider two-player stochastic games played on a finite graph for infinitely many rounds. Stochastic games generalize both Markov decision processes (MDP) by adding an adversary player, and two-player deterministic games by adding…
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.…
Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…
This paper addresses several questions of Feng, Gruenhage, and Shen which arose from Michael's theory of continuous selections from countable spaces. We construct an example of a space which is $L$-selective but not $\mathbb{Q}$-selective…
This article introduces a line of investigation into connections between creature forcings and topological Ramsey spaces. Three examples of sets of pure candidates for creature forcings are shown to contain dense subsets which are actually…
A space $X$ is strongly $Y$-selective (resp., $Y$-selective) if every lower semicontinuous mapping from $Y$ to the nonempty subsets (resp., nonempty closed subsets) of $X$ has a continuous selection. We also call $X$ (strongly)…
In this paper we show that a countable structure admitting a finite monomorphic decomposition has finite big Ramsey degrees if and only if so does every monomorphic part in its minimal monomorphic decomposition. The necessary prerequisite…
Consider the following probabilistic one-player game: The board is a graph with $n$ vertices, which initially contains no edges. In each step, a new edge is drawn uniformly at random from all non-edges and is presented to the player,…
We show that every strongly jump-traceable set obeys every benign cost function. Moreover, we show that every strongly jump-traceable set is computable from a computably enumerable strongly jump-traceable set. This allows us to generalise…
We prove that any strongly mixing action of a countable abelian group on a probability space has higher order mixing properties. This is achieved via introducing and utilizing $\mathcal R$-limits, a notion of convergence which is based on…
We consider the strong Ramsey-type game $\mathcal{R}^{(k)}(\mathcal{H}, \aleph_0)$, played on the edge set of the infinite complete $k$-uniform hypergraph $K^k_{\mathbb{N}}$. Two players, called FP (the first player) and SP (the second…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group $S_\infty$ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with…
The Strong Ramsey game $\mathcal{R}(B,G)$ is a two player game with players $P_1$ and $P_2$, where $B$ and $G$ are $k$-uniform hypergraphs for some $k \geq 2$. $G$ is always finite, while $B$ may be infinite. $P_1$ and $P_2$ alternately…
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…
It is easy to verify the equivalence of the quantum Markov property and the strong additivity of entropy for graded quantum systems as well. However, the structure of Markov states for graded systems is different from that for tensor…
The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions…