Related papers: Transfinite Version of Welter's Game
In this paper we will be examining impartial scoring play games. We first give the basic definitions for what impartial scoring play games are and look at their general structure under the disjunctive sum. We will then examine the game of…
We study the biased $(2:b)$ Walker--Breaker games, played on the edge set of the complete graph on $n$ vertices, $K_n$. These games are a variant of the Maker--Breaker games with the restriction that Walker (playing the role of Maker) has…
This work is concerned with the study of the Game of Graph Nim -- a class of two-player combinatorial games -- on graphs with $4$ edges. To each edge of such a graph is assigned a positive-integer-valued edge-weight, and during each round…
We give a strict mathematical description for a refinement of the Marinatto-Weber quantum game scheme. The model allows the players to choose projector operators that determine the state on which they perform their local operators. The game…
Bachet's game is a variant of the game of Nim. There are $n$ objects in one pile. Two players take turns to remove any positive number of objects not exceeding some fixed number $m$. The player who takes the last object loses. We consider a…
Understanding invertibility in restricted mis\`ere play has been challenging; in particular, the possibility of non-conjugate inverses posed difficulties. Advances have been made in a few specific universes, but a general theorem was…
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…
Combinatorial Game Theory typically studies sequential rulesets with perfect information where two players alternate moves. There are rulesets with {\em entailing moves} that break the alternating play axiom and/or restrict the other…
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…
We announce misere-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misere quotients--commutative monoids that encode the additive structure of specific misere-play games. We also…
We consider a stationary Mean Field Games system defined on a network. In this framework, the transition conditions at the vertices play a crucial role: the ones here considered are based on the optimal control interpretation of the…
We present an algebraic framework for the analysis of combinatorial games. This framework embraces the classical theory of partizan games as well as a number of misere games, comply-constrain games, and card games that have been studied…
We define and give results on the game NecklaceNim NN($n$,$k$) which is PathNim PN($n$,$k$) with an additional move allowed on the end vertices. This game arises as a sub-game in the context of solving CircularNim CN($n$,$k$) when $k-2$…
We consider mis\`{e}re Nim as a normal-play game obtained from Nim by removing the terminal position. While explicit formulas are known for the Sprague-Grundy functions of Nim and Welter's game, no explicit formula is known for that of…
We play a variation of Nim on stacks of tokens. Take your favorite increasing sequence of positive integers and color the tokens according to the following rule. Each token on a level that corresponds to a number in the sequence is colored…
In this paper, the solution of the multi-order differential equations, by using Mellin Transform, is proposed. It is shown that the problem related to the shift of the real part of the argument of the transformed function, arising when the…
We study a quantum version of a penny flip game played using control parameters of the Hamiltonian in the Heisenberg model. Moreover, we extend this game by introducing auxiliary spins which can be used to alter the behaviour of the system.…
We introduce the intermediate set as an interpolating solution concept between the core and the Weber set of a coalitional game. The new solution is defined as the limiting superdifferential of the Lovasz extension and thus it completes the…
We study in detail the so-called looping case of Mozes's game of numbers, which concerns the (finite) orbits in the reflection representation of affine Weyl groups situated on the boundary of the Tits cone. We give a simple proof that all…
We present a proposal for optically implementing the quantum game of the two-player quantum prisoner's dilemma involving nonmaximally entangled states by using beam splitters, phase shifters, cross-Kerr medium, photon detector and the…