Related papers: Quantum Correlated Equilibria in Classical Complet…
Secure equilibrium is a refinement of Nash equilibrium, which provides some security to the players against deviations when a player changes his strategy to another best response strategy. The concept of secure equilibrium is specifically…
This paper studies correlations among independently administered hypothetical tests of a simple interactive type, and demonstrates that correlations arising in quantum information theoretic variants of these tests can exhibit a striking…
A version of the Monty Hall problem is presented where the players are permitted to select quantum strategies. If the initial state involves no entanglement the Nash equilibrium in the quantum game offers the players nothing more than can…
The interplay between exploration and exploitation in competitive multi-agent learning is still far from being well understood. Motivated by this, we study smooth Q-learning, a prototypical learning model that explicitly captures the…
One of the most appealing aspects of the (coarse) correlated equilibrium concept is that natural dynamics quickly arrive at approximations of such equilibria, even in games with many players. In addition, there exist polynomial-time…
No-regret learning dynamics play a central role in game theory, enabling decentralized convergence to equilibrium for concepts such as Coarse Correlated Equilibrium (CCE) or Correlated Equilibrium (CE). In this work, we improve the…
We propose a model for games in which the players have shared access to a blockchain that allows them to deploy smart contracts to act on their behalf. This changes fundamental game-theoretic assumptions about rationality since a contract…
Quantum mechanics dramatically differs from classical physics, allowing for a wide range of genuinely quantum phenomena. The goal of quantum information is to understand information processing from a quantum perspective. In this mindset, it…
The explicit construction is presented of two-player game satisfying: (i) symmetry with respect to the permutation of the players; (ii) the existence of upper bound on total payoff following from Bell inequality; (iii) the existence of…
Quantumgametheoryextendsclassical strategic decision-making by incorporating quantum superposition, entanglement, and measurement-induced randomness into competitive interactions. This paper introduces a team-based Quantum Sabotage Game…
We give a strict mathematical description for a refinement of the Marinatto-Weber quantum game scheme. The model allows the players to choose projector operators that determine the state on which they perform their local operators. The game…
This paper introduces a unified framework called cooperative extensive form games, which (i) generalizes standard non-cooperative games, and (ii) allows for more complex coalition formation dynamics than previous concepts like…
This paper focuses on finite-player incomplete information games where players may hold mutually inconsistent beliefs without a common prior. We introduce absolute continuity of beliefs, extending the classical notion of absolutely…
For decades it is known that Quantum Computers might serve as a tool to solve a very specific kind of problems that have long thought to be incalculable. Some of those problems are of a combinatorial nature, with the quantum advantage…
We present the first study of a dynamical quantum game. Each agent has a `memory' of her performance over the previous m timesteps, and her strategy can evolve in time. The game exhibits distinct regimes of optimality. For small m the…
We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing…
We discuss the connection between a class of distributed quantum games, with remotely located players, to the counter intuitive Braess' paradox of traffic flow that is an important design consideration in generic networks where the addition…
Research in quantum games has flourished during recent years. However, it seems that opinion remains divided about their true quantum character and content. For example, one argument says that quantum games are nothing but 'disguised'…
We introduce a three-player nonlocal game, with a finite number of classical questions and answers, such that the optimal success probability of $1$ in the game can only be achieved in the limit of strategies using arbitrarily…
We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a…