Related papers: A Variant $\beta$-Wythoff Nim on Beatty's Theorem
We introduce the following variant of the Gale-Berlekamp switching game. Let $P$ be a set of n noncollinear points in the plane, each of them having weight $+1$ or $-1$. At each step, we pick a line $\ell$ passing through at least two…
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…
In this article, we study the behavior of a broad family of real sequences derived from randomized one-pile subtraction games. For any subtraction set $S$, we allow any valid number of chips $s\in S$ to be removed at equal probability at…
We study a variant of 3-pile Nim in which a move consists of taking tokens from one pile and, instead of removing then, topping up on a smaller pile provided that the destination pile does not have more tokens then the source pile after the…
Impartial subtraction games on the nonnegative integers have been studied by many and discussed in detail in for example the remarkable work Winning Ways by Conway, Berlekamp and Guy. We describe how comply variations of these games,…
We consider a two-player zero-sum game with integral payoff and with incomplete information on one side, where the payoff is chosen among a continuous set of possible payoffs. We prove that the value function of this game is solution of an…
We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game, known as {\em Blocking Wythoff Nim}, consists of moving a…
We generalise Uspensky's theorem characterising eventual exact (e.e.) covers of the positive integers by homogeneous Beatty sequences, to e.e. m-covers, for any m \in \N, by homogeneous sequences with irrational moduli. We also consider…
Mertens, Neyman and Rosenberg [MOR, 2009] used the Mertens and Neyman theorem [IJGT, 1981] to prove the existence of uniform value for absorbing games with finite state space and compact action sets. We provide an analogous proof for…
Let $P$ and $Q$ be bounded posets. In this note, a lemma is introduced that provides a set of sufficient conditions for the proper part of $P$ being homotopy equivalent to the suspension of the proper part of~$Q$. An application of this…
In this paper, we analyze the mis\`ere versions of two impartial combinatorial games: k-Bounded Greedy Nim and Greedy Nim. We present a complete solution to both games by showing necessary and sufficient conditions for a position to be…
We study variations of classical combinatorial games on two finite heaps of tokens, a.k.a. \emph{subtraction games}. Given non-negative integers $p_1,q_1, p_2,q_2$, where $p_1q_2 > q_1p_2$, $p_1>0$ and $q_2>0$, two players alternate in…
We introduce a hierarchy of conditions necessarily satisfied by any distribution P(ab) representing the probabilities for two separate observers to obtain outcomes a and b when making local measurements on a shared quantum state. Each…
We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations…
A class of non-compact billiards is introduced, namely the infinite step billiards, i.e., systems of a point particle moving freely in the domain $\Omega = \bigcup_{n\in\N} [n,n+1] \times [0,p_n]$, with elastic reflections on the boundary;…
A combinatorial game is a two-player game without hidden information or chance elements. One of the major approaches to analyzing games in combinatorial game theory is to break down a given game position into a disjunctive sum of multiple…
Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
We prove that for any pair $(s,t)$ of nonnegative numbers with $s+t=1$, the set of two-dimensional $(s,t)$-badly approximable vectors is winning for Schmidt's game. As a consequence, we give a direct proof of Schmidt's conjecture using his…
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…