Related papers: Compositional game theory
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…
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytically tractable than the standard definition in terms of…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
We show that any cooperative game can be represented by an assignment of costly facilities to players, in which it is intuitively obvious how to allocate the total cost in an equitable manner. This equitable solution turns out to be the…
With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
Game theory provides a general mathematical background to study the effect of pair interactions and evolutionary rules on the macroscopic behavior of multi-player games where players with a finite number of strategies may represent a wide…
The paper defines a non-cooperative simultaneous finite game to study coalition structure formation with intra and inter-coalition externalities. The novelty of the game is that the game definition embeds a \textit{coalition structure…
The present article is a brief informal survey of computability logic --- the game-semantically conceived formal theory of computational resources and tasks. This relatively young nonclassical logic is a conservative extension of classical…
In this invited contribution, we propose a comprehensive introduction to game theory applied in computer aided synthesis. In this context, we give some classical results on two-player zero-sum games and then on multi-player non zero-sum…
Strategic games admit a multi-graph representation, in which two kinds of relations, accessibility, and preferences, are used to describe how the players compare the possible outcomes. A category of games with a fixed set of players…
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 propose a categorical framework for processes which interact bidirectionally with both an environment and a 'controller'. Examples include open learners, in which the controller is an optimiser such as gradient descent, and an approach…
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…
In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbitrary game into three components, which we refer to as the…
This dissertation reports some first steps towards a compositional account of active inference and the Bayesian brain. Specifically, we use the tools of contemporary applied category theory to supply functorial semantics for approximate…
Following our recent development of a compositional model checking algorithm for Markov decision processes, we present a compositional framework for solving mean payoff games (MPGs). The framework is derived from category theory,…
The model of congestion games is widely used to analyze games related to traffic and communication. A central property of these games is that they are potential games and hence posses a pure Nash equilibrium. In reality it is often the case…
Cooperative interval games are a generalized model of cooperative games in which the worth of every coalition corresponds to a closed interval representing the possible outcomes of its cooperation. Selections are all possible outcomes of…
The relationships between game theory and quantum mechanics let us propose certain quantization relationships through which we could describe and understand not only quantum but also classical, evolutionary and the biological systems that…