Related papers: Admissibility in Quantitative Graph Games
2.5 player parity games combine the challenges posed by 2.5 player reachability games and the qualitative analysis of parity games. These two types of problems are best approached with different types of algorithms: strategy improvement…
Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a…
Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in theoretical computer science, notably as a framework for reactive synthesis. Optimal strategies may require randomisation when dealing with inherently…
We unify standard frameworks for approachability both in full or partial monitoring by defining a new abstract game, called the "purely informative game", where the outcome at each stage is the maximal information players can obtain,…
An ideal strategy in zero-sum games should not only grant the player an average reward no less than the value of Nash equilibrium, but also exploit the (adaptive) opponents when they are suboptimal. While most existing works in Markov games…
Probabilistic Graphical Bayesian models of causation have continued to impact on strategic analyses designed to help evaluate the efficacy of different interventions on systems. However, the standard causal algebras upon which these…
A protocol for considering decoherence in quantum games is presented. Results for two-player, two-strategy quantum games subject to decoherence are derived and some specific examples are given. Decoherence in other types of quantum games is…
In general, finite concurrent two-player reachability games are only determined in a weak sense: the supremum probability to win can be approached via stochastic strategies, but cannot be realized. We introduce a class of concurrent games…
Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the controller, while the other describes the (adversarial) environment, and…
We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a B\"uchi-style winning condition requiring to produce infinitely many play prefixes that satisfy a given regular…
The application of the methods of quantum mechanics to game theory provides us with the ability to achieve results not otherwise possible. Both linear superpositions of actions and entanglement between the players' moves can be exploited.…
Artificial agents are typically oriented to the realization of an externally assigned task and try to optimize over secondary aspects of plan execution such time lapse or power consumption, technically displaying a quasi-dichotomous…
We consider a dynamical approach to game in extensive forms. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding…
Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of…
We generalize a concept of classical finite extensive game to make it useful for application of quantum objects. The generalization extends a quantum realization scheme of static games to any finite extensive game. It represents an…
We prove the existence and computability of optimal strategies in weighted limit games, zero-sum infinite-duration games with a B\"uchi-style winning condition requiring to produce infinitely many play prefixes that satisfy a given regular…
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of…
For every sports tournament, it is an important requirement to provide contestants with the appropriate incentives to perform. However, incentive compatibility is usually considered an all or nothing (binary) concept in the academic…
In this paper, we deepen the study of two-player Stackelberg games played on graphs in which Player $0$ announces a strategy and Player $1$, having several objectives, responds rationally by following plays providing him Pareto-optimal…
We show the existence and effective computability of optimal winning strategies for request-response games in case the quality of a play is measured by the limit superior of the mean accumulated waiting times between requests and their…