Related papers: Covering games using semi-open sets
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement…
We introduce and study the class of semidefinite games, which generalizes bimatrix games and finite $N$-person games, by replacing the simplex of the mixed strategies for each player by a slice of the positive semidefinite cone in the space…
We study \emph{partial-information} two-player turn-based games on graphs with omega-regular objectives, when the partial-information player has \emph{limited memory}. Such games are a natural formalization for reactive synthesis when the…
We consider zero-sum stochastic games with perfect information and finitely many states and actions. The payoff is computed by a function which associates to each infinite sequence of states and actions a real number. We prove that if the…
The classical result of Landau on the existence of kings in finite tournaments (=finite directed complete graphs) is extended to continuous tournaments for which the set X of players is a compact Hausdorff space. The following partial…
In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). The winner is the first one to claim all the edges of some…
We study semi-isolation as a binary relation on the locus of a complete type and prove that under some additional assumptions it induces the strict order property.
With every Eo-semigroup (acting on the algebra of of bounded operators on a separable infinite-dimensional Hilbert space) there is an associated Arveson system. One of the most important results about Arveson systems is that every Arveson…
Vaidman described how a team of three players, each of them isolated in a remote booth, could use a three-qubit Greenberger-Horne-Zeilinger state to always win a game which would be impossible to always win without quantum resources.…
Let $X$ a probability measure space and $\psi_1....\psi_N$ measurable, real valued functions on $X$. Consider all possible partitions of $X$ into $N$ disjoint subdomains $X_i$ on which $\int_{X_i}\psi_i$ are prescribed. We address the…
A communication game consists of distributed parties attempting to jointly complete a task with restricted communication. Such games are useful tools for studying limitations of physical theories. A theory exhibits preparation contextuality…
Let $P \subset \mathbb{R}^{d}$ be a closed convex cone. Assume that $P$ is pointed, i.e. the intersection $P \cap -P=\{0\}$ and $P$ is spanning, i.e. $P-P=\mathbb{R}^{d}$. Denote the interior of $P$ by $\Omega$. Let $E$ be a product system…
This paper presents a case study for the application of semiring semantics for fixed-point formulae to the analysis of strategies in B\"uchi games. Semiring semantics generalizes the classical Boolean semantics by permitting multiple truth…
We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…
We prove that a Hausdorff space $X$ is very $\mathrm I$-favorable if and only if $X$ is the almost limit space of a $\sigma$-complete inverse system consisting of (not necessarily Hausdorff) second countable spaces and surjective d-open…
Strategic interactions between a group of individuals or organisations can be modelled as games played on networks, where a player's payoff depends not only on their actions but also on those of their neighbours. Inferring the network…
We investigate concurrent two-player win/lose stochastic games on finite graphs with prefix-independent objectives. We characterize subgame optimal strategies and use this characterization to show various memory transfer results: 1) For a…
In many multiagent environments, a designer has some, but limited control over the game being played. In this paper, we formalize this by considering incompletely specified games, in which some entries of the payoff matrices can be chosen…
As early as 1935, Schr\"odinger recognized entanglement as ``not one but rather the characteristic trait of quantum mechanics, the one that enforces its entire departure from classical lines of thought''. Indeed, most remarkable phenomena…
We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for…