Related papers: Impartial Scoring Play Games
This article introduces differential hybrid games, which combine differential games with hybrid games. In both kinds of games, two players interact with continuous dynamics. The difference is that hybrid games also provide all the features…
We introduce a semantic approach to the study of logics for access control and dependency analysis, based on Game Semantics. We use a variant of AJM games with explicit justification (but without pointers). Based on this, we give a simple…
In this paper, we will be proving mathematically that scoring play combinatorial game theory covers all combinatorial games. That is, there is a sub-set of scoring play games that are identical to the set of normal play games, and a…
We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…
We use a reformulation of compositional game theory to reunite game theory with game semantics, by viewing an open game as the System and its choice of contexts as the Environment. Specifically, the system is jointly controlled by $n \geq…
We establish a generic result concerning order independence of a dominance relation on finite games. It allows us to draw conclusions about order independence of various dominance relations in a direct and simple way.
Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss…
We introduce the class of pay or play games, which captures scenarios in which each decision maker is faced with a choice between two actions: one with a fixed payoff and an- other with a payoff dependent on others' selected actions. This…
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…
We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for…
We survey recent developments in the theory of impartial combinatorial games in misere play, focusing on how the Sprague-Grundy theory of normal-play impartial games generalizes to misere play via the indistinguishability quotient…
We propose an interpretation of the infinite sum of combinatorial games. In such an interpretation, plays involve infinite runs, but without loops. The notion of a run is quite natural, but different possibilities arises for the notion of…
There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…
In this paper, we investigate a partially observable zero sum games where the state process is a discrete time Markov chain. We consider a general utility function in the optimization criterion. We show the existence of value for both…
We introduce and analyse an extension of the disjunctive sum operation on some classical impartial games. Whereas the disjunctive sum describes positions formed from independent subpositions, our operation combines positions that are not…
Mean Field Game systems describe equilibrium configurations in differential games with infinitely many infinitesimal interacting agents. We introduce a learning procedure (similar to the Fictitious Play) for these games and show its…
We announce misere-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misere quotients--commutative monoids that encode the additive structure of specific misere-play games. We also…
In this paper we survey various notions of anonymity and symmetry for finite strategic-form games present in relevant literature, and discuss notions of fairness; show that game bijections and game isomorphisms form groupoids; introduce…
This paper is concerned with a new type of differential game problems of forwardbackward stochastic systems. There are three distinguishing features: Firstly, our game systems are forward-backward doubly stochastic differential equations,…
Subtraction games is a class of impartial combinatorial games, They with finite subtraction sets are known to have periodic nim-sequences. So people try to find the regular of the games. But for specific of Sprague-Grundy Theory, it is too…