Quantum Prisoner’s Dilemma game on hypergraph networks

Łukasz Pawela and Jan Sladkowski ()

Physica A: Statistical Mechanics and its Applications, 2013, vol. 392, issue 4, 910-917

Abstract: We study the possible advantages of adopting 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: Quantum information; Game theory; Hypergraphs (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437112009351
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:392:y:2013:i:4:p:910-917

DOI: 10.1016/j.physa.2012.10.034

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().