Related papers: Compactness properties defined by open-point games

We explore a version of the minimax theorem for two-person win-lose games with infinitely many pure strategies. In the countable case, we give a combinatorial condition on the game which implies the minimax property. In the general case, we…

This paper studies a language-based opacity enforcement in a two-player, zero-sum game on a graph. In this game, player 1 (P1) wins if it can achieve a secret temporal goal described by the language of a finite automaton, no matter what…

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 consider capacity (fuzzy measure, non-additive probability) on a compactum as a monotone cooperative normed game. We introduce topological analogues of well known class of exact games and show that these classes form subfunctors of the…

We call a function $f: X\to Y$ $P$-preserving if, for every subspace $A \subset X$ with property $P$, its image $f(A)$ also has property $P$. Of course, all continuous maps are both compactness- and connectedness-preserving and the natural…

We show that each of the regularity properties of regular conditional distributions of correspondences (convexity, closedness, compactness, and preservation of closed graphs) is equivalent to the condition of nowhere equivalence. This…

We introduce a two-player game, in which each player extends a given sequence by picking a free element in a domain D of the real line. The aim of the players is to control the parity of the number of transpositions necessary to put the…

Let $X$ be a space. A space $Y$ is called an extension of $X$ if $Y$ contains $X$ as a dense subspace. For an extension $Y$ of $X$ the subspace $Y\backslash X$ of $Y$ is called the remainder of $Y$. Two extensions of $X$ are said to be…

We establish that the existence of a winning strategy in certain topological games, closely related to a strong game of Choquet, played in a topological space $X$ and its hyperspace $K(X)$ of all nonempty compact subsets of $X$ equipped…

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…

Let $A$ and $B$ be compact operators over a topological space $X$ and suppose that these operators are normal and have same distinct eigenvalues at each point. By obstruction theory, we establish a necessary and sufficient condition for $A$…

We discuss some notions of compactness and convergence relative to a specified family F of subsets of some topological space X. The two most interesting particular cases of our construction appear to be the following ones. (1) The case in…

A topological space is called P_2 ( P_3, P_{<omega} ) if and only if it does not contain two (three, finitely many) uncountable open sets with empty intersection. We show that (i) there are 0-dimensional P_{<omega} spaces of size 2^omega,…

A graph $G = (V,E)$ is said to be saturated with respect to a monotone increasing graph property ${\mathcal P}$, if $G \notin {\mathcal P}$ but $G \cup \{e\} \in {\mathcal P}$ for every $e \in \binom{V}{2} \setminus E$. The saturation game…

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…

While compactness is an essential assumption for many results in dynamical systems theory, for many applications the state space is only locally compact. Here we provide a general theory for compactifying such systems, i.e. embedding them…

Let M be the countably infinite metric fan. We show that C_k(M,2) is sequential and contains a closed copy of Arens space S_2. It follows that if X is metrizable but not locally compact, then C_k(X) contains a closed copy of S_2, and hence…

Let $\mathfrak{P}$ be a topological property. We study the relation between the order structure of the set of all $\mathfrak{P}$-extensions of a completely regular space $X$ with compact remainder (partially ordered by the standard partial…

Any nonempty, compact, semi-algebraic set in [0, 1] n is the projection of the set of mixed equilibria of a finite game with 2 actions per player on its first n coordinates. A similar result follows for sets of equilibrium payoffs. The…

In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a…