1202.5934 (Ł. Pawela et al.)

Quantum Prisoner's Dilemma game on hypergraph networks    [PDF]

Ł. Pawela, J. Sładkowski

We study the beneficialness of quantum strategies in multi-player evolutionary games. We base our study on the three-player Prisoner's Dilemma (PD) game. In order to model the simultaneous interaction between three agents we use hypergraphs and hypergraph networks. In particular, we study two types of networks: a random network and a SF-like network. The obtained results show that in the case of a three player game on a hypergraph network, quantum strategies not necessarily are Evolutionary Stable Strategies. In some cases, the defection strategy can be as good as a quantum one.

View original: http://arxiv.org/abs/1202.5934