Related papers: Selective game version of q-points
In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…
A combinatorial game is a two-player game without hidden information or chance elements. One of the major approaches to analyzing games in combinatorial game theory is to break down a given game position into a disjunctive sum of multiple…
How coperation between self-interested individuals evolve is a crucial problem, both in biology and in social sciences, that is far from being well understood. Evolutionary game theory is a useful approach to this issue. The simplest model…
Inspired by the theory of poset games, we introduce a new compound of impartial combinatorial games and provide a complete analysis in the spirit of the Sprague-Grundy theory. Furthermore, we establish several substitution and reduction…
We examine the selective screenability property in topological groups. In the metrizable case we also give characterizations in terms of the Haver property and finitary Haver property respectively relative to left-invariant metrics. We…
We analyze a two-player game in which players take turns avoiding the selection of certain points within a convex geometry. The objective is to prevent the convex closure of all chosen points from encompassing a predefined set. The first…
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…
Quantum game theory is a recently developing field of physical research. In this paper, we investigate quantum games in a systematic way. With the famous instance of the Prisoner's Dilemma, we present the fascinating properties of quantum…
In this paper the Shapley value of digraph (directed graph) games are considered. Digraph games are transferable utility (TU) games with limited cooperation among players, where players are represented by nodes. A restrictive relation…
Turn-based discounted-sum games are two-player zero-sum games played on finite directed graphs. The vertices of the graph are partitioned between player 1 and player 2. Plays are infinite walks on the graph where the next vertex is decided…
Quantum phenomena have remained largely inaccessible to the general public. This can be attributed to the fact that we do not experience quantum mechanics on a tangible level in our daily lives. Games can provide an environment in which…
Given an impartial combinatorial game G, we create a class of related games (CIS-G) by specifying a finite set of positions in G and forbidding players from moving to those positions (leaving all other game rules unchanged). Such…
We propose a new model of provenance, based on a game-theoretic approach to query evaluation. First, we study games G in their own right, and ask how to explain that a position x in G is won, lost, or drawn. The resulting notion of game…
We propose a game-theoretic framework that incorporates both incomplete information and general ambiguity attitudes on factors external to all players. Our starting point is players' preferences on payoff-distribution vectors, essentially…
$\omega$-regular energy games, which are weighted two-player turn-based games with the quantitative objective to keep the energy levels non-negative, have been used in the context of verification and synthesis. The logic of modal…
We formulate and analyze game-theoretic problems for systems governed by integral equations. For Volterra integral equations, we obtain and prove necessary and sufficient conditions for linear-quadratic problems, and for problems that are…
The maintenance of cooperation in the presence of spatial restrictions has been studied extensively. It is well-established that the underlying graph topology can significantly influence the outcome of games on graphs. Maintenance of…
We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed non-negative integer bonus for picking a…
State-of-the-art deep Q-learning methods update Q-values using state transition tuples sampled from the experience replay buffer. This strategy often uniformly and randomly samples or prioritizes data sampling based on measures such as the…
We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit…