Related papers: Set Equality in Combinatorial Game Theory
In this paper we extend the equal division and the equal surplus division values for transferable utility cooperative games to the more general setup of transferable utility cooperative games with a priori unions. In the case of the equal…
A combinatorial game is a two-player game without hidden information or chance elements. The disjunctive sum $G + H$ of games $G$ and $H$ is the game in which $G$ and $H$ are played in parallel, and a player makes a move on exactly one of…
We introduce and investigate a range of general notions of a game. Our principal notion is based on a set of agents modifying a relational structure in a discrete evolution sequence. We also introduce and study a variety of ways to model…
We study the process theoretic notion of stuttering equivalence in the setting of parity games. We demonstrate that stuttering equivalent vertices have the same winner in the parity game. This means that solving a parity game can be…
We develop a theory of combinatorial games that is appropriate for describing positions in Hex and other monotone set coloring games. We consider two natural conditions on such games: a game is monotone if all moves available to both…
In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In…
We introduce a new combinatorial game, named Triangle Game. In this game, a directed $3$-cycle graph is given, and tokens are placed on each vertex. The player chooses an edge and takes at least one token from the initial vertex. At the…
Game semantics is a rich and successful class of denotational models for programming languages. Most game models feature a rather intuitive setup, yet surprisingly difficult proofs of such basic results as associativity of composition of…
We state and prove Kuhn's equivalence theorem for a new representation of games, the intrinsic form. First, we introduce games in intrinsic form where information is represented by $\sigma$-fields over a product set. For this purpose, we…
Quantum game theory lays a foundation for understanding the interaction of people using quantum computers with conflicting interests. Recently Zhang proposed a simple yet rich model to study quantum strategic games, and addressed some…
Quantum Decision Theory, advanced earlier by the authors, and illustrated for lotteries with gains, is generalized to the games containing lotteries with gains as well as losses. The mathematical structure of the approach is based on the…
This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…
Scoring play games were first studied by Fraser Stewart for his PhD thesis. He showed that under the disjunctive sum, scoring play games are partially ordered, but do not have the same "nice" structure of normal play games. In this paper I…
This paper proposes a new approach to power in Game Theory. Cooperation and conflict are simulated with a mechanism of payoff alteration, called F-game. Using convex combinations of preferences, an F-game can measure players' attitude to…
An interaction system has a finite set of agents that interact pairwise, depending on the current state of the system. Symmetric decomposition of the matrix of interaction coefficients yields the representation of states by self-adjoint…
The security game is a basic model for resource allocation in adversarial environments. Here there are two players, a defender and an attacker. The defender wants to allocate her limited resources to defend critical targets and the attacker…
Game-theoretic interactions with AI agents could differ from traditional human-human interactions in various ways. One such difference is that it may be possible to simulate an AI agent (for example because its source code is known), which…
In cooperative game theory, the social configurations of players are modeled by balanced collections. The Bondareva-Shapley theorem, perhaps the most fundamental theorem in cooperative game theory, characterizes the existence of solutions…
This work extends the present author's computational game semantics of Martin-L\"{o}f type theory to the cumulative hierarchy of universes. This extension completes game semantics of all standard types of Martin-L\"{o}f type theory for the…
The class of Guaranteed Scoring Games (GS) are two-player combinatorial games with the property that Normal-play games (Conway et. al.) are ordered embedded into GS. They include, as subclasses, the scoring games considered by Milnor…