arXiv Open Access 2012

Quantum Prisoner's Dilemma game on hypergraph networks

Ł. Pawela J. Sładkowski

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

quant-ph physics.soc-ph

Penulis (2)

Ł. Pawela

J. Sładkowski

Format Sitasi

APA MLA BibTeX

Pawela, Ł., Sładkowski, J. (2012). Quantum Prisoner's Dilemma game on hypergraph networks. https://arxiv.org/abs/1202.5934

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓