Related papers: Schmidt Games and Conditions on Resonant Sets
We introduce and develop a class of \textit{Cantor-winning} sets that share the same amenable properties as the classical winning sets associated to Schmidt's $(\alpha,\beta)$-game: these include maximal Hausdorff dimension, invariance…
We study Manneville-Pomeau maps on the unit interval and prove that the set of points whose forward orbits miss an interval with left endpoint 0 is strong winning for Schmidt's game. Strong winning sets are dense, have full Hausdorff…
Approximation in this paper is of vectors on the unit $d$-cube by the projection of integer lattice points onto the same cube. We define badly approximable vectors on a rational quadratic variety and show that sets of these vectors, which…
We prove that the countable intersection of $C^1$-diffeomorphic images of certain Diophantine sets has full Hausdorff dimension. For example, we show this for the set of badly approximable vectors in $\mathbb{R}^d$, improving earlier…
We prove that for every two natural numbers M and N, if Tau is a Borel, finite, absolutely friendly measure on a compact set K of R^MN, then the intersection of K and BA(M,N) is a winning set in Schmidt's game sense played on K, where…
We show that the set of numbers with bounded L\"uroth expansions (or bounded L\"uroth series) is winning and strong winning. From either winning property, it immediately follows that the set is dense, has full Hausdorff dimension, and…
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…
In 1998 Kleinbock conjectured that any set of weighted badly approximable $d\times n$ real matrices is a winning subset in the sense of Schmidt's game. In this paper we prove this conjecture in full for vectors in $\mathbf{R}^d$ in…
In \cite{SchmidtGames}, W. Schmidt proved that the set of non-normal numbers in base $b$ is a {\it winning set}. We generalize this result by proving that many sets of non-normal numbers with respect to the Cantor series expansion are…
We prove a result in the area of twisted Diophantine approximation related to the theory of Schmidt games. In particular, under certain restrictions we give a affirmative answer to the analogue in this setting of a famous conjecture of…
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…
We introduce a connection between Newhouse thickness and patterns through a variant of Schmidt's game introduced by Broderick, Fishman and Simmons. This yields an explicit, robust and checkable condition that ensures the presence of…
Aiming to provide a new class of game dynamics with good long-term rationality properties, we derive a second-order inertial system that builds on the widely studied "heavy ball with friction" optimization method. By exploiting a well-known…
Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…
For any real number \t, the set of all real numbers x for which there exists a constant c(x) > 0 such that \inf_{p \in \ZZ} |\t q - x - p| \geq c(x)/|q| for all q in \ZZ {0} is an 1/8-winning set.
We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the correlated equilibrium set is convex and compact, the structure…
We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…
In view of the complexity of the dynamics of learning in games, we seek to decompose a game into simpler components where the dynamics' long-run behavior is well understood. A natural starting point for this is Helmholtz's theorem, which…
Many interactions result in a socially suboptimal equilibrium, or in a non-equilibrium state, from which arriving at an equilibrium through simple dynamics can be impossible of too long. Aiming to achieve a certain equilibrium, we persuade,…
We address the numerical approximation of Mean Field Games with local couplings. For power-like Hamiltonians, we consider both unconstrained and constrained stationary systems with density constraints in order to model hard congestion…