Related papers: Multiplayer Rock-Paper-Scissors
We generalize Rock Paper Scissors to complete directed graphs, or tournaments, on $n$ vertices. Properties of the mixed-strategy Nash equilibria of these tournaments are discussed, particularly those with Nash equilibria where all of the…
We study a class of algebras that can be used as recognisers for regular languages of infinite trees.
The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent…
Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…
In this paper we first define a new kind of potential games, called coset weighted potential game, which is a generalized form of weighted potential game. Using semi-tensor product of matrices, an algebraic method is provided to verify…
We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…
We explore the question concerning the number of distinct resonant algebras depending on the generator content, which consists of the Lorentz generator, translation, and new additional Lorentz-like and translation-like generators. Such…
The survey contains a brief description of the ideas, constructions, results, and prospects of the theory of hypergroups and generalized translation operators. Representations of hypergroups are considered, being treated as continuous…
We provide a complete classification of the singularities of cluster algebras of finite type with trivial coefficients. Alongside, we develop a constructive desingularization of these singularities via blowups in regular centers over fields…
We construct 2 families of automorphic forms related to twisted fake monster algebras and calculate their Fourier expansions. This gives a new proof of their denominator identities and shows that they define automorphic forms of singular…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…
Absolute combinatorial game theory was recently developed as a unifying tool for constructive/local game comparison (Larsson et al. 2018). The theory concerns {\em parental universes} of combinatorial games; standard closure properties are…
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for…
In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…
We give lower bounds in terms of~$n,$ for the number of limit cycles of polynomial vector fields of degree~$n,$ having any prescribed invariant algebraic curve. By applying them when the ovals of this curve are also algebraic limit cycles…
We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…
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…
Scissors congruence groups have traditionally been expressed algebraically in terms of group homology. We give an alternate construction of these groups by producing them as the $0$-level in the algebraic $K$-theory of a Waldhausen…