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

The foundations of classical Algebraic Geometry and Real Algebraic Geometry are the Nullstellensatz and Positivstellensatz. Over the last two decades the basic analogous theorems for matrix and operator theory (noncommutative variables)…

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,…

We introduce perfect half space games, in which the goal of Player 2 is to make the sums of encountered multi-dimensional weights diverge in a direction which is consistent with a chosen sequence of perfect half spaces (chosen dynamically…

In this paper, we investigate a partially observable zero sum games where the state process is a discrete time Markov chain. We consider a general utility function in the optimization criterion. We show the existence of value for both…

In this paper, we prove the following Theorems 1. An extremally disconnected space $X$ has the semi-Menger property if and only if One does not have a winning strategy in the game $G_{fin}(sO,sO)$. 2. An extremally disconnected space $X$…

We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a…

This paper contributes a new class of games called spacetime games with perfect information. In spacetime games, the agents make decisions at various positions in Minkowski spacetime. Spacetime games can be seen as the least common…

The main goal of the paper is the full proof of a cardinal inequality for a space with points $G_\delta $, obtained with the help of a long version of the Menger game. This result, which improves a similar one of Scheepers and Tall, was…

An open question of Gruenhage asks if all strategically selectively separable spaces are Markov selectively separable, a game-theoretic statement known to hold for countable spaces. As a corollary of a result by Berner and Juh$\acute{a}$sz,…

Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded programs, we might expect to axiomatize bisimilarity via a…

In this paper we study connections between topological games such as Rothberger, Menger and compact-open, and relate these games to properties involving covers by G_{\delta} subsets. The results include: (1) If Two has a winning strategy in…

We define the distance between two information structures as the largest possible difference in value across all zero-sum games. We provide a tractable characterization of distance and use it to discuss the relation between the value of…

In this note we study the open-point topological games in order to analyze the least upper bound for density of dense subsets of a topological space. This way we may also analyze the behavior of such cardinal invariants in taking products…

The notion of Aronszajn-null sets generalizes the notion of Lebesgue measure zero on the real line and the Euclidean space to infinite dimensional Banach spaces. We present a game-theoretic approach to Aronszajn-null sets, establish its…

Zero-determinant strategies are a class of strategies in repeated games which unilaterally control payoffs. Zero-determinant strategies have attracted much attention in studies of social dilemma, particularly in the context of evolution of…

We relate the property of discrete selectivity and its corresponding game, both recently introduced by V.V. Tkachuck, to a variety of selection principles and point picking games. In particular we show that player II can win the discrete…

This paper provides sufficient conditions for the existence of solutions for two-person zero-sum games with inf/sup-compact payoff functions and with possibly noncompact decision sets for both players. Payoff functions may be unbounded, and…

Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…

We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that two games are "strategically equivalent" if, for every…

In this note we relate some selection principles to metrisability and separability of a manifold. In particular we show that $\sf{S}_{fin}(\mathcal K,\mathcal O)$, $\sf{S}_{fin}(\Omega,\Omega)$ and $\sf{S}_{fin}(\Lambda,\Lambda)$ are each…