Related papers: A Variant $\beta$-Wythoff Nim on Beatty's Theorem
Shapley operators of undiscounted zero-sum two-player games are order-preserving maps that commute with the addition of a constant. We characterize the fixed point sets of Shapley operators, in finite dimension (i.e., for games with a…
We introduce a new type of positional games, played on a vertex set of a graph. Given a graph $G$, two players claim vertices of $G$, where the outcome of the game is determined by the subgraphs of $G$ induced by the vertices claimed by…
By a geometrical treatment of the Bethe ansatz, we obtain an exact solution for the totally asymmetric exclusion process on a ring. We derive an explicit determinant expression for the non-stationary conditional probability…
Recently 't Hooft demonstrated that ``For any quantum system there exists at least one deterministic model that reproduces all its dynamics after prequantization''. An extension is presented here which covers quantum systems that are…
In an amalgamation Nim, players are allowed to use a move from the traditional form of Nim or to amalgamate two piles when they are not empty. No formula that describes the set of P-positions of Amalgamation Nim is known. The author gives a…
We derive first-order and second-order field equations from ambitwistor spaces as phase spaces of massless particles. In particular, the second-order field equations of Yang-Mills theory and general relativity are formulated in a unified…
Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…
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,…
A poset game is a two-player game played over a partially ordered set (poset) in which the players alternate choosing an element of the poset, removing it and all elements greater than it. The first player unable to select an element of the…
In this paper we give an extension of the Birkhoff--Lewis theorem to some semilinear PDEs. Accordingly we prove existence of infinitely many periodic orbits with large period accumulating at the origin. Such periodic orbits bifurcate from…
We give an example of irrational vector $\pmb{\theta} \in \mathbb{R}^2$ such that the set $Bad_{\pmb{\theta}} := \{(\eta_1,\eta_2): \inf_{x\in\mathbb{N}} x^{\frac{1}{2}} \max_{i=1,2} \|x \theta_i-\eta_i\|>0\}$ is not absolutely winning with…
We study zero-sum games, a variant of the classical combinatorial Subtraction games (studied for example in the monumental work "Winning Ways", by Berlekamp, Conway and Guy), called Cumulative Subtraction (CS). Two players alternate in…
Bell's theorem cannot be proved if complementary measurements have to be represented by random variables which cannot be added or multiplied. One such case occurs if their domains are not identical. The case more directly related to the…
The present paper deals with connected subtraction games in graphs, which are generalization of takeaway games. In a connected subtraction game, two players alternate removing a connected sub-graph from a given connected game-graph,…
In this paper we show that the continuum time version of the Minority Game satisfies the criteria for the application of a theorem on the existence of an invariant measure. We consider the special case of a game with "sufficiently"…
Positional games are a well-studied class of combinatorial game. In their usual form, two players take turns to play moves in a set (`the board'), and certain subsets are designated as `winning': the first person to occupy such a set wins…
To generalize complementarities for games, we introduce some conditions weaker than quasisupermodularity and the single crossing property. We prove that the Nash equilibria of a game satisfying these conditions form a nonempty complete…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
We show that every two-player stochastic game with finite state and action sets and bounded, Borel-measurable, and shift-invariant payoffs, admits an $\ep$-equilibrium for all $\varepsilon>0$.
The quantum state of a particle can be completely specified by a position at one instant of time. This implies a lack of information, hence a symmetry, as to where the particle will move. We here study the consequences for free particles of…