Related papers: Card Games Unveiled: Exploring the Underlying Line…
In the literature on game-theoretic equilibrium finding, focus has mainly been on solving a single game in isolation. In practice, however, strategic interactions -- ranging from routing problems to online advertising auctions -- evolve…
First, we study the linear equations in general. Second, we focus our attention in periodic sequences over finite fields and de Bruijn directed graph.
This paper explores the relationship between matrix factorizations and linear matrix equations. It shows that every matrix factorization defines two hidden projectors, one for the column space and one for the row space of a matrix, and how…
A group of students in 7-9 grades are inventing combinatorial impartial games. The games are played on graphs, piles, and grids. We found winning positions, optimal strategies, and other interesting facts about the games.
We conduct the first study of its kind to generate and evaluate vector representations for chess pieces. In particular, we uncover the latent structure of chess pieces and moves, as well as predict chess moves from chess positions. We share…
We define a family of vertex colouring games played over a pair of graphs or digraphs $(G,H)$ by players $\forall$ and $\exists$. These games arise from work on a longstanding open problem in algebraic logic. It is conjectured that there is…
We introduce parallelism into the basic algebra of games to model concurrent game algebraically. Parallelism is treated as a new kind of game operation. The resulted algebra of concurrent games can be used widely to reason the parallel…
This paper is about the following question: How many riffle shuffles mix a deck of card for games such as blackjack and bridge? An object that comes up in answering this question is the descent polynomial associated with pairs of decks,…
Probabilistic concurrent/distributed strategies have so far not been investigated thoroughly in the context of imperfect information, where the Player has only partial knowledge of the moves made by the Opponent. In a situation where the…
Linear algebra is usually defined over a field such as the reals or complex numbers. It is possible to extend this to skew fields such as the quaternions. However, to the authors' knowledge there is no commonly accepted notation of linear…
The notions of captured/lost vertices and dead edges in the Shannon game (Shannon switching game on nodes) are examined using graph theory. Simple methods are presented for identifying some dead edges and some captured sets of vertices,…
A class of linear positive, trace preserving maps in $M_n$ is given in terms of affine maps in $\bBR^{n^2-1}$ which map the closed unit ball into itself.
Parity games are simple infinite games played on finite graphs with a winning condition that is expressive enough to capture nested least and greatest fixpoints. Through their tight relationship to the modal mu-calculus, they are used in…
Octal games are a well-defined family of two-player games played on heaps of counters, in which the players remove alternately a certain number of counters from a heap, sometimes being allowed to split a heap into two nonempty heaps, until…
We investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters…
In this paper, some real-world motivated examples are provided illustrating the power of linear algebra tools as the product of matrices, determinants, eigenvalues and eigenvectors. In this sense, some practical applications related to…
We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these \emph{lattice games} can be made particularly efficient for octal games, which we generalize to…
For any odd integer $n\geq3$ a board (of size $n$) is a square array of $n\times n$ positions with a simple rule of how to move between positions. The goal of the game we introduce is to find a path from the upper left corner of a board to…
Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know…
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…