Related papers: Determinacy and indeterminacy of games played on c…
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…
We consider Schmidt's game on the space of compact subsets of a given metric space equipped with the Hausdorff metric, and the space of continuous functions equipped with the supremum norm. We are interested in determining the generic…
Winning sets of Schmidt's game enjoy a remarkable rigidity. Therefore, this game (and modifications of it) have been applied to many examples of complete metric spaces (X, d) to show that the set of "badly approximable points", with respect…
Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…
The Banach-Mazur game, Schmidt's game and McMullen's absolute winning game are three quintessential intersection games. We investigate their determinacy on the real line when the target set for either player is a Bernstein set, a…
We prove that the set of bounded geodesics in Teichmuller space are a winning set for Schmidt's game. This is a notion of largeness in a metric space that can apply to measure 0 and meager sets. We prove analogous closely related results on…
We show that the sets of weighted badly approximable vectors in $\Bbb R^n$ are winning sets of certain games, which are modifications of $(\alpha,\beta)$-games introduced by W. Schmidt in 1966. The latter winning property is stable with…
Schmidt's game is generally used to deduce qualitative information about the Hausdorff dimensions of fractal sets and their intersections. However, one can also ask about quantitative versions of the properties of winning sets. In this…
The set of badly approximable numbers, Bad, is known to be winning for Schmidt's game and hence has full Hausdorff dimension. It is also known that the set of inhomogeneously badly approximable numbers has full dimension. We prove that the…
In this paper we study the classical Schmidt game on two families of sets: one related to frequencies of digits in base-$2$ expansions, and one connected to the set of the badly approximable numbers. Namely, we describe some nontrivial…
We construct (\alpha ,\beta) and \alpha -winning sets in the sense of Schmidt's game, played on the support of certain measures (very friendly and awfully friendly measures) and show how to derive the Hausdorff dimension for some. In…
Let $f: M \to M$ be a $C^{1+\theta}$-partially hyperbolic diffeomorphism. We introduce a type of modified Schmidt games which is induced by $f$ and played on any unstable manifold. Utilizing it we generalize some results of \cite{Wu} as…
While many types of non-measurable sets are never $(\alpha, \beta)$-winning in the sense of Schmidt's game, we show that this is not the case for certain Vitali sets. Our main theorems show that for certain values of $\alpha, \beta$ one can…
n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as…
We propose a new determinacy hypothesis for transfinite games, use the hypothesis to extend the perfect set theorem, prove relationships between various determinacy hypotheses, expose inconsistent versions of determinacy, and provide a…
We explore and refine techniques for estimating the Hausdorff dimension of exceptional sets and their diffeomorphic images. Specifically, we use a variant of Schmidt's game to deduce the strong C^1 incompressibility of the set of badly…
In a zero-sum stochastic game with signals, at each stage, two adversary players take decisions and receive a stage payoff determined by these decisions and a variable called state. The state follows a Markov chain, that is controlled by…
We consider a class of nonlocal games that are related to binary constraint systems (BCSs) in a manner similar to the games implicit in the work of Mermin [N.D. Mermin, "Simple unified form for the major no-hidden-variables theorems," Phys.…
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…
In this paper, we extend the Descent framework, which enables learning and planning in the context of two-player games with perfect information, to the framework of stochastic games. We propose two ways of doing this, the first way…