Quantum Prisoner's Dilemma game on hypergraph networks
arXiv:1202.5934 · doi:10.1016/j.physa.2012.10.034
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.
6 pages, 5 figures. arXiv admin note: text overlap with arXiv:quant-ph/0004076 by other authors
References in corpus (2)
Cited by in corpus (11)
- Uncertainty measurement with belief entropy on interference effect in Quantum-Like Bayesian Networks
- Cooperative quantum Parrondo's games
- Central limit theorem for reducible and irreducible open quantum walks
- General model for a entanglement-enhanced composed quantum game on a two-dimensional lattice
- Generalized open quantum walks on Apollonian networks
- Quantum games on evolving random networks
- Permissible extensions of classical to quantum games combining three strategies
- A quantum extension to inspection game
- Agent-based Modelling of Quantum Prisoner's Dilemma
- On the equivalence between non-factorizable mixed-strategy classical games and quantum games
- Social optimality in quantum Bayesian games