Related papers: Multiplayer quantum Minority game with decoherence

A new approach to play games quantum mechanically is proposed. We consider two players who perform measurements in an EPR-type setting. The payoff relations are defined as functions of *correlations*, i.e. without reference to classical or…

Effects of classical/quantum correlations and operations in game theory are analyzed using Samaritan's Dilemma. We observe that introducing either quantum or classical correlations to the game results in the emergence of a unique or…

We prove for every $n\ge4$ the existence of an $n$-player game in normal form with integer payoffs that has a unique Nash equilibrium, which is fully mixed. In the equilibrium, each probability weight is an algebraic number of degree…

We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fall into a certain interval may lead to undecidability. In…

An open problem in linear quadratic (LQ) games has been characterizing the Nash equilibria. This problem has renewed relevance given the surge of work on understanding the convergence of learning algorithms in dynamic games. This paper…

We discuss stochastic dynamics of finite populations of individuals playing games. We review recent results concerning the dependence of the long-run behavior of such systems on the number of players and the noise level. In the case of…

We investigate a multi-player and multi-choice quantum game. We start from two-player and two-choice game and the result is better than its classical version. Then we extend it to N-player and N-choice cases. In the quantum domain, we…

To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…

Establishing the existence of Nash equilibria for partially observed stochastic dynamic games is known to be quite challenging, with the difficulties stemming from the noisy nature of the measurements available to individual players…

An heuristic approach to compute strong Nash (Aumann) equilibria is presented. The method is based on differential evolution and three variants of a generative relation for strong Nash equilibria characterization. Numerical experiments…

In several game situations, the behavior of the players may depend not only on individual interests, but also on what each player considers as the correct thing to do. This work presents a game theoretic model, aiming to describe game…

A fair gambling is hard to be made between two spatially separated parties without introducing a trusted third party. Here we propose a novel gambling protocol, which enables fair gambling between two distant parties without the help of a…

The emergence of cooperation figures among the main goal of game theory in competitive-cooperative environments. Potential games have long been hinted as viable alternatives to study realistic player behavior. Here, we expand the potential…

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…

Multi-agent learning algorithms have been shown to display complex, unstable behaviours in a wide array of games. In fact, previous works indicate that convergent behaviours are less likely to occur as the total number of agents increases.…

In general, Nash equilibria in normal-form games may require players to play (probabilistically) mixed strategies. We define a measure of the complexity of finite probability distributions and study the complexity required to play Nash…

We develop an octonionic representation of the payoff function for three player, two strategy, maximally entangled quantum games in order to obtain computationally friendly version of this function. This computational capability is then…

We propose a payoff function extending Minority Games (MG) that captures the competition between agents to make money. In constrast with previous MG, the best strategies are not always targeting the minority but are shifting…

We consider a class of dynamic collective choice models with social interactions, whereby a large number of non-uniform agents have to individually settle on one of multiple discrete alternative choices, with the relevance of their would-be…

In a recent paper, Eisert et al. presented a quantum mechanical generalization of Prisoner's Dilemma. They asserted that the maximally entangled game exhibits a unique Nash equilibrium which yields a pay-off equivalent to cooperative…