Related papers: A game for Baire's grand theorem
We obtain several game characterizations of Baire 1 functions between Polish spaces X, Y which extends the recent result of V. Kiss. Then we propose similar characterizations for equi-Bare 1 families of functions. Also, using related ideas,…
We extend Solovay's theorem about definable subsets of the Baire space to the generalized Baire space ${}^\lambda\lambda$, where $\lambda$ is an uncountable cardinal with $\lambda^{<\lambda}=\lambda$. In the first main theorem, we show that…
Duparc introduced a two-player game for a function $f$ between zero-dimensional Polish spaces in which Player II has a winning strategy iff $f$ is of Baire class 1. We generalize this result by defining a game for an arbitrary function $f :…
We extend the Fundamental Theorem of Epistemic Game Theory to games with Baire class one payoffs and locally compact Polish strategy spaces, and under Projective Determinacy, to games with analytically measurable payoffs and arbitrary…
This paper deals with different concepts for characterizing the size of mathematical objects. A game theoretic investigation and generalization of two size concepts, which can both be formulated in topological terms, is provided: the so…
We introduce two new model comparison games that characterize separability by first-order formulas with generalized quantifiers. One is built on the Ehrenfeucht-Fra\"iss\'e game and the other is a formula-size game.
We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…
Schmidt's game, and other similar intersection games have played an important role in recent years in applications to number theory, dynamics, and Diophantine approximation theory. These games are real games, that is, games in which the…
Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such…
A generalized model of games is proposed, in which cooperative games and non-cooperative games are special cases. Some games that are neither cooperative nor non-cooperative can be expressed and analyzed. The model is based on relationships…
It is well known that if the nonempty player of the Banach-Mazur game has a winning strategy on a space, then that space is Baire in all powers even in the box topology. The converse of this implication may be true also: We know of no…
We prove that if X is a separable metric space with the Hurewicz covering property, then the Banach-Mazur game played on X is determined. The implication is not true when "Hurewicz covering property" is replaced with "Menger covering…
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…
We characterize the initial positions from which the first player has a winning strategy in a certain two-player game. This provides a generalization of Hall's theorem. Vizing's edge coloring theorem follows from a special case.
Infinite games (in the form of Gale-Stewart games) are studied where a play is a sequence of natural numbers chosen by two players in alternation, the winning condition being a subset of the Baire space $\omega^\omega$. We consider such…
We generalize Banaszczyk's seminal tail bound for the Gaussian mass of a lattice to a wide class of test functions. From this we obtain quite general transference bounds, as well as bounds on the number of lattice points contained in…
$AD_{\mathbb{R}}$ is the Axiom of Determinacy for games on the reals (i.e., the player play reals. We show that it implies that all sets of reals are Theta-universally Baire. As a corollary we obtain a model in which $AD$ holds and all sets…
We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity,…
We consider a real-valued function $f$ defined on the set of infinite branches $X$ of a countably branching pruned tree $T$. The function $f$ is said to be a \textit{limsup function} if there is a function $u \colon T \to \mathbb{R}$ such…
We characterize countable dimensionality and strong countable dimensionality by means of an infinite game.