Related papers: Schmidt games and Cantor winning sets

For any pair of real numbers $(i,j)$ with $0<i,j<1$ and $i+j=1$, we prove that the set of $p$-adic mixed $(i,j)$-badly approximable numbers $\bad_p(i, j)$ is 1/2-winning in the sense of Schmidt's game. This improves a recent result of…

In this paper, ideas of open ball, closed ball, compact set are introduced and some related basic properties are studied. Some topological properties and some other well known results of metric spaces including Cantor intersection theorem…

We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose…

We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…

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…

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

We obtain a complete description for a probability measure to be doubling on an arbitrarily given uniform Cantor set. The question of which doubling measures on such a Cantor set can be extended to a doubling measure on [0; 1] is also…

We introduce a natural variant of weighted voting games, which we refer to as k-Prize Weighted Voting Games. Such games consist of n players with weights, and k prizes, of possibly differing values. The players form coalitions, and the i-th…

A theory is universal contextual if its prediction cannot be reproduced by an ontological model satisfying both preparation and measurement noncontextuality assumptions. In this report, we first generalize the logical proofs of quantum…

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 give an example of Cantor type set for which its equilibrium measure and the corresponding Hausdorff measure are mutually absolutely continuous. Also we show that these two measures are regular in Stahl-Totik sense.

A class of ultrametric Cantor sets $(C, d_{u})$ introduced recently in literature (Raut, S and Datta, D P (2009), Fractals, 17, 45-52) is shown to enjoy some novel properties. The ultrametric $d_{u}$ is defined using the concept of {\em…

Subtraction games are a classical topic in Combinatorial Game Theory. A result of Golomb~(1966) shows that every subtraction game with a finite move set has an eventually periodic nim-sequence, but the known proof yields only an exponential…

Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners of a subset of nodes. We investigate here how effective…

We show that under natural technical conditions, the sum of a $C^2$ dynamically defined Cantor set with a compact set in most cases (for almost all parameters) has positive Lebesgue measure, provided that the sum of the Hausdorff dimensions…

Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of $n$ players is assigned a hat from a given color set.…

We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect…

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…