Related papers: Simple Characterizations of Potential Games and Ze…

We investigate the quantization of non-zero sum games. For the particular case of the Prisoners' Dilemma we show that this game ceases to pose a dilemma if quantum strategies are allowed for. We also construct a particular quantum strategy…

Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea''…

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…

Zero-determinant strategies are a class of strategies in repeated games which unilaterally control payoffs. Zero-determinant strategies have attracted much attention in studies of social dilemma, particularly in the context of evolution of…

This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement on the two states to determine the players' payoffs. We…

Potential game is an emerging notion and framework for studying N-player games, especially with heterogeneous players. In this paper, we build an analytical framework for dynamic potential games. We prove that a game is a dynamic potential…

Parity games play a central role in model checking and satisfiability checking. Solving parity games is computationally expensive, among others due to the size of the games, which, for model checking problems, can easily contain $10^9$…

In this expository article, we give an overview of the concept of potential mean field games of first order. We give a new proof that minimizers of the potential are equilibria by using a Lagrangian formulation. We also provide criteria to…

A large body of research is currently investigating on the connection between machine learning and game theory. In this work, game theory notions are injected into a preference learning framework. Specifically, a preference learning problem…

An algorithm is proposed to verify whether a finite game is a weighted potential game (WPG) without pre-knowledge on its weights. Then the algorithm is also applied to find the closest WPG for a given finite game. The concept and criterion…

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…

Quantum games have proposed a new point of view for the solution of the classical problems and dilemmas in game theory. Certain quantization relationships can be proposed with the objective that a game can be generalized into a quantum…

We present two zero-sum games modeling situations where one player attacks (or hides in) a finite dimensional nonempty compact set, and the other tries to prevent the attack (or find him). The first game, called patrolling game, corresponds…

Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players. In this paper, we compare the three…

We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a)…

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…

This article identifies a gap between the existence of a various psychometric tests approaches and other team performance assessment tools (e.g. business and management games). As a response to the lack of tools able to utilize the…

We introduce the concept of Conversion/Preference Games, or CP games for short. CP games generalize the standard notion of strategic games. First we exemplify the use of CP games. Second we formally introduce and define the CP-games…

Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems,…

Games are usually created incrementally, requiring repeated testing of the same scenarios, which is a tedious and error-prone task for game developers. Therefore, we aim to alleviate this game testing process by encapsulating it into a game…