Quantization of two- and three-player cooperative games based on QRA

Abstract

In this paper, a novel quantization scheme for cooperative games is proposed. The circuit is inspired by the Eisert-Wilkens-Lewenstein protocol, which was modified to represent cooperation between players and extended to 3-qubit states. The framework of Clifford algebra is used to perform necessary computations. In particular, we use a direct analogy between Dirac formalism and Quantum Register Algebra (QRA) to represent circuits. This analogy enables us to perform automated proofs of the circuit equivalence in a simple fashion. The expected value of the Shapley value concerning quantum probabilities is employed to distribute players' payoffs after the measurement. We study how entanglement, representing the level of pre-agreement between players, affects the final utility distribution. The paper also demonstrates how the QRA and GAALOP software can automate all necessary calculations.In this paper, a novel quantization scheme for cooperative games is proposed. The circuit is inspired by the Eisert-Wilkens-Lewenstein protocol, which was modified to represent cooperation between players and extended to 3-qubit states. The framework of Clifford algebra is used to perform necessary computations. In particular, we use a direct analogy between Dirac formalism and Quantum Register Algebra (QRA) to represent circuits. This analogy enables us to perform automated proofs of the circuit equivalence in a simple fashion. The expected value of the Shapley value concerning quantum probabilities is employed to distribute players' payoffs after the measurement. We study how entanglement, representing the level of pre-agreement between players, affects the final utility distribution. The paper also demonstrates how the QRA and GAALOP software can automate all necessary calculations.