Related papers: Positional Games and QBF: A Polished Encoding

We present a quantization scheme for a three-player Prisoner's Dilemma game. It is shown that entanglement plays a dominant role in the three-player quantum game. Four different types of payoffs are identified on the basis of different…

We study two-player games on finite graphs. Turn-based games have many nice properties, but concurrent games are harder to tame: e.g. turn-based stochastic parity games have positional optimal strategies, whereas even basic concurrent…

We quantize prisoners dilemma, chicken game and battle of sexes to explore the effect of quantization on their strategic form. The games start with Werner-like state as an initial state. We show that for the measurement in entangled basis…

The move-minimizing puzzles presented here are certain types of one-player combinatorial games that are shown to have explicit solutions whenever they can be encoded in a certain way as diamond-colored modular or distributive lattices. Our…

A number of model-comparison games central to (finite) model theory, such as pebble and Ehrenfeucht-Fra\"{i}ss\'{e} games, can be captured as comonads on categories of relational structures. In particular, the coalgebras for these comonads…

Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners of a subset of nodes. We investigate here how effective…

The convexification numerical method with the rigorously established global convergence property is constructed for a problem for the Mean Field Games System of the second order. This is the problem of the retrospective analysis of a game…

The paper introduces a new approach to theory of differential games in which entangled players try to predict and influence actions of their adversaries. The entanglement is generated be a joint probability density known by the players.…

We study variations of classical combinatorial games on two finite heaps of tokens, a.k.a. \emph{subtraction games}. Given non-negative integers $p_1,q_1, p_2,q_2$, where $p_1q_2 > q_1p_2$, $p_1>0$ and $q_2>0$, two players alternate in…

Quixo is a two-player game played on a 5$\times$5 grid where the players try to align five identical symbols. Specifics of the game require the usage of novel techniques. Using a combination of value iteration and backward induction, we…

Over the last few years, much progress has been made in the theory and practice of solving quantified Boolean formulas (QBF). Novel solvers have been presented that either successfully enhance established techniques or implement novel…

We study two-player inclusion games played over word-generating higher-order recursion schemes. While inclusion checks are known to capture verification problems, two-player games generalize this relationship to program synthesis. In such…

We consider two-player partial-observation stochastic games on finite-state graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are \omega-regular conditions specified as parity…

We introduce and study Minkowski games. These are two player games, where the players take turns to chose positions in $\mathbb{R}^d$ based on some rules. Variants include boundedness games, where one player wants to keep the positions…

The legal positions of a strong placement game, such as Domineering, form a simplicial complex called the legal complex. In this paper, we use the legal complex to study the game values taken on by the class of strong placement games using…

Strategic interactions often take place in an environment rife with uncertainty. As a result, the equilibrium of a game is intimately related to the information available to its players. The \emph{signaling problem} abstracts the task faced…

The discontinuous dependence of the properties of a quantum game on its entanglement has been shown up to be very much like phase transitions viewed in the entanglement-payoff diagram [J. Du et al., Phys. Rev. Lett, 88, 137902 (2002)]. In…

In this paper the complexity of provability of polarized additive, multiplicative, and exponential formulas in the (initial) Cockett-Seely polarized game logic is discussed. The complexity is ultimately based on the complexity of finding a…

We explain why numbers occurring in the classification of polygon spaces coincide with numbers of self-dual equivalence classes of threshold functions, or of regular Boolean functions, or of decisive weighted majority games.

We develop a new approach that computes approximate equilibrium strategies in Jotto, a popular word game. Jotto is an extremely large two-player game of imperfect information; its game tree has many orders of magnitude more states than…