Related papers: Modified Schmidt games and Diophantine approximati…
We prove that the Littlewood conjecture is satisfied for a restricted class of pairs $(\alpha,\beta)$ of badly approximable numbers. We use the localization of the roots of a cubic equation with coefficients depending on the diophantine…
In an earlier paper (joint with Min Ru), we proved a result on diophantine approximation to Cartier divisors, extending a 2011 result of P. Autissier. This was recently extended to certain closed subschemes (in place of divisors) by Ru and…
Game theory is playing more and more important roles in understanding complex systems and in investigating intelligent machines with various uncertainties. As a starting point, we consider the classical two-player zero-sum linear-quadratic…
This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length $\omega$ on $\kappa$ is…
Recently Koivusalo, Levesley, Ward and Zhang introduced the set of simultaneously $\Phi$-badly approximable real vectors of $\mathbb{R}^m$ with respect to an approximation function $\Phi$, and determined its Hausdorff dimension for the…
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…
By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form…
The class of exact transferable utility coalitional games, introduced in 1972 by Schmeidler, has been studied both in the context of game theory and in the context of imprecise probabilities. We characterize the cone of exact games by…
In this paper we investigate the problem of how well points in finite dimensional p-adic solenoids can be approximated by rationals. The setting we work in was previously studied by Palmer, who proved analogues of Dirichlet's theorem and…
We introduce and analyze the ordered Zeckendorf game, a novel combinatorial two-player game inspired by Zeckendorf's Theorem, which guarantees a unique decomposition of every positive integer as a sum of non-consecutive Fibonacci numbers.…
Let $n \ge 2$ be an integer and $\xi$ a transcendental real number. We establish several new relations between the values at $\xi$ of the exponents of Diophantine approximation $w_n, w_{n}^{\ast}, \hat{w}_{n}$, and $\hat{w}_{n}^{\ast}$.…
McLennan and Tourky (2010) showed that "imitation games" provide a new view of the computation of Nash equilibria of bimatrix games with the Lemke-Howson algorithm. In an imitation game, the payoff matrix of one of the players is the…
We establish a weighted simultaneous Khintchine-type theorem, both convergence and divergence, for all nondegenerate manifolds, which answers a problem posed in [Math. Ann., 337(4):769-796, 2007]. This extends the main results of [Acta…
In this paper, we study the metrical theory of Cartesian products of exact approximation sets in $\beta$-expansions. More precisely, for an integer $d \ge 2$ and real numbers $\beta_i > 1$ $(1 \le i \le d)$, we consider the set of points…
Parsimonious games are a subset of constant sum homogeneous weighted majority games unequivocally described by their free type representation vector. We show that the minimal winning quota of parsimonious games satisfies a second order,…
In 1990, Mermin presented a n player game that is won with certainty using n spin-1/2 particles in a GHZ state whilst no classical strategy (or local theory) can win with probability higher than ${1/2} + \frac{1}{2^{\lceil n/2 \rceil}}$…
Determining how close a winner of an election is to becoming a loser, or distinguishing between different possible winners of an election, are major problems in computational social choice. We tackle these problems for so-called weighted…
We consider the distribution of the orbits of the number 1 under the $\beta$-transformations $T_\beta$ as $\beta$ varies. Mainly, the size of the set of $\beta>1$ for which a given point can be well approximated by the orbit of 1 is…
The set of badly approximable $m \times n $ matrices is known to have Hausdorff dimension $mn $. Each such matrix comes with its own approximation constant $c$, and one can ask for the dimension of the set of badly approximable matrices…
Let $\alpha$ be an irrational real number. We show that the set of $\epsilon$-badly approximable numbers \[ \mathrm{Bad}^\varepsilon (\alpha) := \{x\in [0,1]\, : \, \liminf_{|q| \to \infty} |q| \cdot \| q\alpha -x \| \geq \varepsilon \} \]…