Social optimality in quantum Bayesian games

Abstract

A significant aspect of the study of quantum strategies is the exploration of the game-theoretic solution concept of the Nash equilibrium in relation to the quantization of a game. Pareto optimality is a refinement on the set of Nash equilibria. A refinement on the set of Pareto optimal outcomes is known as social optimality in which the sum of players' payoffs are maximized. This paper analyzes social optimality in a Bayesian game that uses the setting of generalized Einstein-Podolsky-Rosen experiments for its physical implementation. We show that for the quantum Bayesian game a direct connection appears between the violation of Bell's inequality and the social optimal outcome of the game and that it attains a superior socially optimal outcome.

12 pages, revised

References in corpus (11)

• Experimental realization of a quantum game on a one-way quantum computer
• A necessary and sufficient condition to play games in quantum mechanical settings
• Quantum advantages in classically defined tasks
• Probabilistic analysis of three-player symmetric quantum games played using the Einstein-Podolsky-Rosen-Bohm setting
• Constructing quantum games from non-factorizable joint probabilities
• Coalitions in the quantum Minority game: classical cheats and quantum bullies
• A Formalism for Quantum Games and an Application
• N-player quantum games in an EPR setting
• Characterising the Performance of XOR Games and the Shannon Capacity of Graphs
• General quantum two-players games, their gate operators and Nash equilibria
• Quantum games and social norms. The quantum ultimatum game