Related papers: Universality of Infinite Chess
We analyze the computational complexity of optimally playing the two-player board game Push Fight, generalized to an arbitrary board and number of pieces. We prove that the game is PSPACE-hard to decide who will win from a given position,…
In a classical chess round-robin tournament, each of $n$ players wins, draws, or loses a game against each of the other $n-1$ players. A win rewards a player with 1 points, a draw with 1/2 point, and a loss with 0 points. We are interested…
For any partition of a positive integer we consider the chess (or draughts) colouring of its associated Ferrers graph. Let b denote the total number of black unit squares, and w the number of white squares. In this note we characterize all…
Domineering is a two player game played on a checkerboard in which one player places dominoes vertically and the other places them horizontally. We give bivariate generating polynomials enumerating Domineering positions by the number of…
Consider a game where Alice generates an integer and Bob wins if he can factor that integer. Traditional game theory tells us that Bob will always win this game even though in practice Alice will win given our usual assumptions about the…
A placement of chess pieces on a chessboard is called dominating, if each free square of the chessboard is under attack by at least one piece. In this contribution we compute the number of dominating arrangements of $k$ rooks on an $n\times…
We identify structural assumptions which provide solvability of the Nash system arising from a linear-quadratic closed-loop game, with stable properties with respect to the number of players. In a setting of interactions governed by a…
This work demonstrates that natural language transformers can support more generic strategic modeling, particularly for text-archived games. In addition to learning natural language skills, the abstract transformer architecture can generate…
We study multi-player turn-based games played on (potentially infinite) directed graphs. An outcome is assigned to every play of the game. Each player has a preference relation on the set of outcomes which allows him to compare plays. We…
Every positive integer may be written uniquely as a base-$\beta$ decomposition--that is a legal sum of powers of $\beta$--where $\beta$ is the dominating root of a non-increasing positive linear recurrence sequence. Guided by earlier work…
It is shown that Borel games of length $\omega^2$ are determined if, and only if, for every countable ordinal $\alpha$, there is a fine-structural, countably iterable extender model of Zermelo set theory with $\alpha$-many iterated…
Pursuing a new approach to the study of infinite games in combinatorics, we introduce the categories $\mathbf{Game}_{A}$ and $\mathbf{Game}_{B}$ and improve some classical results concerning topological games related to the duality between…
We present a version of the Banach-Mazur game, where open sets are replaced by elements of a fixed partially ordered set. We show how to apply it in the theory of Fraisse limits and beyond, obtaining simple proofs of universality of certain…
The results in this paper add useful tools to the theory of sets of desirable gambles, a growing toolbox for reasoning with partial probability assessments. We investigate how to combine a number of marginal coherent sets of desirable…
We consider finite $n$-person deterministic graphical games and study the existence of pure stationary Nash-equilibrium in such games. We assume that all infinite plays are equivalent and form a unique outcome, while each terminal position…
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. Here we use coinduction, or backward coinduction (to show its…
We investigate a game played between two players, Maker and Breaker, on a countably infinite complete graph where the vertices are the rational numbers. The players alternately claim unclaimed edges. It is Maker's goal to have after…
In repeated games, players choose actions concurrently at each step. We consider a parameterized setting of repeated games in which the players form a population of an arbitrary size. Their utility functions encode a reachability objective.…
The game of chess is well-known and widely played all over the world. However, the rules for playing it are rather complex since there are different types of pieces and the ways they are allowed to move depend upon the type of the piece. In…