相关论文: $\mathcal{L}\mathcal{R}$-Ending partisan rulesets

Something is definitely wrong. If the game has a linear winning strategy, then it is tractable. What's going on? Well, we describe a two-person game which has a definite winner, that is, a player who can force a win in a finite number of…

We consider two-player random extensive form games where the payoffs at the leaves are independently drawn uniformly at random from a given feasible set C. We study the asymptotic distribution of the subgame perfect equilibrium outcome for…

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…

Universal partizan ruleset is a ruleset in which every game value of partizan games can be appear as a position. So far, generalized konane and turning tiles have been proved to be universal partizan rulesets. In this paper, we introduce…

For a finite set $V\subset \mathbb{R}^n$, a set $T\subset \mathbb{R}^n$ is called $V$-closed if $t \in T$ and $v\in V$ imply that either $t+v\in T$ or $t-v \in T$. The set $P(V):=\{\sum_{v \in W} v: W \subset V\}$ is clearly $V$-closed and…

We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…

We introduce a new type of positional games, played on a vertex set of a graph. Given a graph $G$, two players claim vertices of $G$, where the outcome of the game is determined by the subgraphs of $G$ induced by the vertices claimed by…

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 linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of $n$ linear…

We demonstrate that a ubiquitous feature of network games, bilateral strategic interactions, is equivalent to having player utilities that are additively separable across opponents. We distinguish two formal notions of bilateral strategic…

A general position set of a graph $G$ is a set of vertices $S$ in $G$ such that no three vertices from $S$ lie on a common shortest path. In this paper we introduce and study the general position achievement game. The game is played on a…

Coherent sets of almost desirable gambles and credal sets are known to be equivalent models. That is, there exists a bijection between the two collections of sets preserving the usual operations, e.g. conditioning. Such a correspondence is…

In this work we have introduced two party games with respective winning conditions. One cannot win these games deterministically in the classical world if they are not allowed to communicate at any stage of the game. Interestingly we find…

By resorting to the vector space structure of finite games, skew-symmetric games (SSGs) are proposed and investigated as a natural subspace of finite games. First of all, for two player games, it is shown that the skew-symmetric games form…

We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category,…

We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear…

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…

In games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a large part of the player population consists of imitation…

We show that two-dimensional billiard systems are Turing complete, in the sense that the halting of any Turing machine with a given input is equivalent to a certain bounded trajectory in this system entering a specified open set. Billiards…

The disjunctive sum of impartial games is analyzed by Sprague-Grundy theory. The theory has been extended to loopy games and entailing games by early results. In this study, we consider further extension of this theory and show partial…