Related papers: Quantum Game with Restricted Matrix Strategies
We analyse the role of degree of entanglement for Vaidman's game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be…
We pursue a general theory of quantum games. We show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. We demonstrate that the set of finite classical games is a strict…
The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property of…
When modeling robot interactions as Nash equilibrium problems, it is desirable to place coupled constraints which restrict these interactions to be safe and acceptable (for instance, to avoid collisions). Such games are continuous with…
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic results (such as the existence of a Nash equilibrium) no longer…
We consider $n$ risk-averse agents who compete for liquidity in an Almgren--Chriss market impact model. Mathematically, this situation can be described by a Nash equilibrium for a certain linear-quadratic differential game with state…
We consider a game in which the action set of each player is uncountable, and show that, from weak assumptions on the common prior, any mixed strategy has an approximately equivalent pure strategy. The assumption of this result can be…
We study the evolutionary stability of Nash equilibria (NE) in a symmetric quantum game played by the recently proposed scheme of applying `identity' and `Pauli spin flip' operators on the initial state with classical probabilities. We show…
We study equilibrium concepts in non-cooperative games under uncertainty where both beliefs and mixed strategies are represented by non-additive measures (capacities). In contrast to the classical Nash framework based on additive…
The use of game theoretic methods for control in multiagent systems has been an important topic in recent research. Valid utility games in particular have been used to model real-world problems; such games have the convenient property that…
At a mixed Nash equilibrium, the payoff of a player does not depend on her own action, as long as her opponent sticks to his. In a periodic strategy, a concept developed in a previous paper (arXiv:1307.2035v4), in contrast, the own payoff…
We consider a slightly modified version of the Rock-Scissors-Paper (RSP) game from the point of view of evolutionary stability. In its classical version the game has a mixed Nash equilibrium (NE) not stable against mutants. We find a…
We introduce Q-Nash, a quantum annealing algorithm for the NP-complete problem of Fnding pure Nash equilibria in graphical games. The algorithm consists of two phases. The first phase determines all combinations of best response strategies…
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…
We consider a non-cooperative constrained stochastic games with N players with the following special structure. With each player there is an associated controlled Markov chain. The transition probabilities of the i-th Markov chain depend…
In this paper, we study deterministic mean field games for agents who operate in a bounded domain. In this case, the existence and uniqueness of Nash equilibria cannot be deduced as for unrestricted state space because, for a large set of…
We consider two aspects of quantum game theory: the extent to which the quantum solution solves the original classical game, and to what extent the new solution can be obtained in a classical model.
This paper introduces two fundamentally new concepts to game theory: multilateral Nash equilibria and families of games. Starting with non-cooperative games, we show how these notions together seamlessly integrate into and naturally extend…
A quantum game in the Eisert scheme is defined by the payoff matrix, plus some quantum entanglement parameters. In the symmetric nonzero-sum 2x2 games, the relevant features of the game are given by two parameters in the payoff matrix, and…
We analyze classically defined games for which a quantum team has an advantage over any classical team. The quantum team has a clear advantage in games in which the players of each team are separated in space and the quantum team can use…