Related papers: Simple game semantics and Day convolution
This paper unifies the concepts of evolutionary games and quantum strategies. First, we state the formulation and properties of classical evolutionary strategies, with focus on the destinations of evolution in 2-player 2-strategy games. We…
An extension of the WHILE-language is developed for programming game-theoretic mechanisms involving multiple agents. Examples of such mechanisms include auctions, voting procedures, and negotiation protocols. A structured operational…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
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…
Game theory is a powerful framework for reasoning about strategic interactions, with applications in domains ranging from day-to-day life to international politics. However, applying formal reasoning tools in such contexts is challenging,…
Humans can learn many novel tasks from a very small number (1--5) of demonstrations, in stark contrast to the data requirements of nearly tabula rasa deep learning methods. We propose an expressive class of policies, a strong but general…
We use simplicial complexes to model simple games as well as weighted voting games where certain coalitions are considered impossible. Topological characterizations of various ideas from simple games are provided, as are the expressions for…
The concept of dimension in simple games was introduced as a measure of the remoteness of a given game from a weighted game. Taylor and Zwicker (1993) demonstrated that the dimension of a simple game can grow exponentially in the number of…
The note is devoted to an interactive game theoretic formalization of dialogues as psycholinguistic phenomena and the unraveling of a hidden dialogue structure of 2-person differential interactive games. In the field-theoretic description…
We study stochastic evolution of optional games on simple graphs. There are two strategies, A and B, whose interaction is described by a general payoff matrix. In addition there are one or several possibilities to opt out from the game by…
If the influence diagram (ID) depicting a Bayesian game is common knowledge to its players then additional assumptions may allow the players to make use of its embodied irrelevance statements. They can then use these to discover a simpler…
This is an introduction to Game Semantics based on some lecture notes given at the CLiCS II summer school in Cambridge in 1995. We will focus on the recent (1994) work on Game semantics, which has led to some striking advances in the Full…
The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. In a weakly acyclic game, from any starting state, there is a sequence of better-response moves…
A popular graphical calculus for monoidal categories makes computations tactile and intuitive. Complicated diagram chases can be expressed in a few pictures and discovered by playing with a shoelace. Joyal and Street's proof of the…
A simple game $(N,v)$ is given by a set $N$ of $n$ players and a partition of $2^N$ into a set $\mathcal{L}$ of losing coalitions $L$ with value $v(L)=0$ that is closed under taking subsets and a set $\mathcal{W}$ of winning coalitions $W$…
Selection of input features such as relevant pieces of text has become a common technique of highlighting how complex neural predictors operate. The selection can be optimized post-hoc for trained models or incorporated directly into the…
Game-theoretic formulations of feature importance have become popular as a way to "explain" machine learning models. These methods define a cooperative game between the features of a model and distribute influence among these input elements…
In this manuscript, we define and study probabilistic values for cooperative games on simplicial complexes. Inspired by the work of Weber "Probabilistic values for games", we establish the new theory step by step, following the classical…
Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games. Both of them…
In a distributed game we imagine a team Player engaging a team Opponent in a distributed fashion. Such games and their strategies have been formalised in concurrent games based on event structures. However there are limitations in founding…