Related papers: Multi-Structural Games and Number of Quantifiers
Behavioural equivalences can be characterized via bisimulations, modal logics and spoiler-defender games. In this paper we review these three perspectives in a coalgebraic setting, which allows us to generalize from the particular branching…
A valuation for a player in a game in extensive form is an assignment of numeric values to the players moves. The valuation reflects the desirability moves. We assume a myopic player, who chooses a move with the highest valuation.…
A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. The measurement setting in each round, as well as the final score of the…
In the Maker-Breaker resolving game, two players named Resolver and Spoiler alternately select unplayed vertices of a given graph $G$. The aim of Resolver is to select all the vertices of some resolving set of $G$, while Spoiler aims to…
M\"uller games form a well-established class of games for model checking and verification. These games are played on directed graphs $\mathcal G$ where Player 0 and Player 1 play by generating an infinite path through the graph. The winner…
We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…
The study focuses on strategic-form games extended in the Eisert-Wilkens-Lewenstein scheme by two unitary operations. Conditions are determined under which the pair of unitary operators, along with classical strategies, form a game…
In the inference attacks studied in Quantitative Information Flow (QIF), the attacker typically tries to interfere with the system in the attempt to increase its leakage of secret information. The defender, on the other hand, typically…
This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main…
We propose a statistical framework for quantifying the importance of single events that do not provide intermediate rewards but offer implicit incentives through the reward structure at the end of a multi-event contest. Applying the…
We consider a sequential inspection game where an inspector uses a limited number of inspections over a larger number of time periods to detect a violation (an illegal act) of an inspectee. Compared with earlier models, we allow varying…
In 1973 Fraenkel discovered interesting sequences which split the positive integers. These sequences became famous, because of a related unsolved conjecture. Here we construct combinatorial games, with `playable' rulesets, with these…
Let $f: M \to M$ be a $C^{1+\theta}$-partially hyperbolic diffeomorphism. We introduce a type of modified Schmidt games which is induced by $f$ and played on any unstable manifold. Utilizing it we generalize some results of \cite{Wu} as…
Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…
We use Ehrenfeucht-Fra\"iss\'e games to give a local geometric criterion for elementary equivalence of II$_1$ factors. We obtain as a corollary that two II$_1$ factors are elementarily equivalent if and only their unitary groups are…
An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…
Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…
We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…