Related papers: How to play two-players restricted quantum games w…

In the Eisert protocol for 2 X 2 quantum games [Phys. Rev. Lett. 83, 3077], a number of authors have investigated the features arising from making the strategic space a two-parameter subset of single qubit unitary operators. We argue that…

We present a quantum approach to a signaling game; a special kind of extensive games of incomplete information. Our model is based on quantum schemes for games in strategic form where players perform unitary operators on their own qubits of…

We study variants of a stochastic game inspired by backgammon where players may propose to double the stake, with the game state dictated by a one-dimensional random walk. Our variants allow for different numbers of proposals and different…

We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is…

The Mermin-Peres magic square game is a cooperative two-player nonlocal game in which shared quantum entanglement allows the players to win with certainty, while players limited to classical operations cannot do so, a phenomenon dubbed…

Consider QBF, the Quantified Boolean Formula problem, as a combinatorial game ruleset. The problem is rephrased as determining the winner of the game where two opposing players take turns assigning values to boolean variables. In this…

Parity games are simple infinite games played on finite graphs with a winning condition that is expressive enough to capture nested least and greatest fixpoints. Through their tight relationship to the modal mu-calculus, they are used in…

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…

The noncooperative Nash equilibrium solution of classical games corresponds to a rational expectations attitude on the part of the players. However, in many cases, games played by human players have outcomes very different from Nash…

We argue that a restriction determined by a drawn card or quantum random numbers, on the running of LHC (Large Hadron Collider), which was proposed in earlier articles by us, can only result in an, at first, apparent success whatever the…

There are only limited classes of multi-player stochastic games in which independent learning is guaranteed to converge to a Nash equilibrium. Markov potential games are a key example of such classes. Prior work has outlined sets of…

A quantum logic gate of particular interest to both electrical engineers and game theorists is the quantum multiplexer. This shared interest is due to the facts that an arbitrary quantum logic gate may be expressed, up to arbitrary…

In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. A cluster groups together agents with a similar "strategic…

The aim of this paper is to discuss in some detail the two different quantum schemes for duopoly problems. We investigate under what conditions one of the schemes is more reasonable that the other one. Using the Cournot's duopoly example we…

Recent spectrum-sharing research has produced a strategy to address spectrum scarcity problems. This novel idea, named cognitive radio, considers that secondary users can opportunistically exploit spectrum holes left temporarily unused by…

We revisit the classic 'guess my number' game and extend it from its familiar binary form to representations in any integer base. For each base we derive formulas for the number of cards needed to identify a given integer and, conversely,…

To date all self-tests for high dimensional systems are confined to many-qubit states. This is due to two restrictions in the literature: the standard techniques for proving self-testing results apply only to qubits, and there are few…

In a seminal paper, Meyer [David Meyer, Phys. Rev. Lett. 82, 1052 (1999)] described the advantages of quantum game theory by looking at the classical penny flip game. A player using a quantum strategy can win against a classical player…

Quantum computation is an emerging technology that promises a wide range of possible use cases. This promise is primarily based on algorithms that are unlikely to be viable over the coming decade. For near-term applications, quantum…

We consider 2-players, 2-values minimization games where the players' costs take on two values, $a,b$, $a<b$. The players play mixed strategies and their costs are evaluated by unimodal valuations. This broad class of valuations includes…