Quantum Prisoner's Dilemma game on hypergraph networks
Quantum Physics
2020-11-10 v2 Physics and Society
Abstract
We study the possible advantages of adopting 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 are not necessarily stochastically stable strategies. In some cases, the defection strategy can be as good as a quantum one.
Keywords
Cite
@article{arxiv.1202.5934,
title = {Quantum Prisoner's Dilemma game on hypergraph networks},
author = {Ł. Pawela and J. Sładkowski},
journal= {arXiv preprint arXiv:1202.5934},
year = {2020}
}
Comments
6 pages, 5 figures. arXiv admin note: text overlap with arXiv:quant-ph/0004076 by other authors