Related papers: Schmidt's Game and Vitali Sets
We introduce a new two-player game on graphs, in which players alternate choosing vertices until the set of chosen vertices forms a dominating set. The last player to choose a vertex is the winner. The game fits into the scheme of several…
J. An (2013) proved that for any $s,t \geq 0$ such that $s + t = 1$, $\mathbf{Bad}(s,t)$ is $(34\sqrt 2)^{-1}$-winning for Schmidt's game. We show that using the main lemma from An's paper one can derive a stronger result, namely that…
Let A and B be two first order structures of the same relational vocabulary L. The Ehrenfeucht-Fraisse-game of length gamma of A and B denoted by EFG_gamma(A,B) is defined as follows: There are two players called for all and exists. First…
Can vectors with low Schmidt rank form mutually unbiased bases? Can vectors with high Schmidt rank form positive under partial transpose states? In this work, we address these questions by presenting several new results related to Schmidt…
Non-transitivity can arise in games with three or more strategies $A,B,C$, when $A$ beats $B$, $B$ beats $C$, and $C$ beats $A$, ($A>B>C>A$). An example is the children's game \textquotedblleft rock, scissors, paper" ($R,S,P$) where…
We prove that the set of (r_1,r_2,..,r_{d})-badly approximable vectors is a winning set if r_1=r_2=...=r_{d-1}\geq r_{d}.
Something is definitely wrong. If the game has a linear winning strategy, then it is tractable. What's going on? Well, we describe a two-person game which has a definite winner, that is, a player who can force a win in a finite number of…
This paper deals with the so-called Boltzmann billiard, that is, a billiard subjected to a central force of the type $V(r)=-\alpha/r-\beta/r^2$, $\alpha$ and $\beta$ being positive constants, and with a straight reflection table. In the…
We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order. This, in turn, means that the parties exert a back-action on the causal…
The \emph{stationary set splitting game} is a game of perfect information of length $\omega_{1}$ between two players, \unspls and \spl, in which \unspls chooses stationarily many countable ordinals and \spls tries to continuously divide…
A famous result in game theory known as Zermelo's theorem says that "in chess either White can force a win, or Black can force a win, or both sides can force at least a draw". The present paper extends this result to the class of all…
We give an example of a measurable set of reals E such that the set E'={(x,y): x+y in E} is not in the sigma-algebra generated by the rectangles with measurable sides. We also prove a stronger result that there exists an analytic set E such…
Let the sets of functions $Z$ and $\Omega$ be given on the time interval $T$, let there also be a multifunction (m/f) $\alpha$ acting from $\Omega$ to $Z$ and a finite set of moments $\Delta$ from $T$. The work deals with two questions: the…
We consider the complexity of special $\alpha$-limit sets, a kind of backward limit set for non-invertible dynamical systems. We show that these sets are always analytic, but not necessarily Borel, even in the case of a surjective map on…
In each round of a Swiss-system tournament, players of similar score are paired against each other. An intentional early loss therefore might lead to weaker opponents in later rounds and thus to a better final tournament result - a…
A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding…
In this article, we shall explore the constructions of Bernstein sets, and prove that every Bernstein set is nonmeasurable and doesn't have the property of Baire. We shall also prove that Bernstein sets don't have the perfect set property.
It is well known that the (unique) value of a stochastic control problem or a two person zero sum game under Isaacs condition can be characterized through a PDE driven by the Hamiltonian. Our goal of this paper is to extend this classical…
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,…
We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…