Quantum games on evolving random networks
{\L}ukasz Pawela

TL;DR
This paper investigates how quantum strategies can influence evolutionary social dilemmas on dynamic networks, showing quantum advantages in certain game scenarios and parameter regions.
Contribution
It introduces the application of quantum strategies to evolving random networks in social dilemmas, highlighting their benefits and coexistence with classical strategies.
Findings
Quantum strategies improve outcomes in the prisoner's dilemma.
Quantum strategies dominate in specific parameter regions for snowdrift and stag-hunt.
Classical and quantum strategies coexist depending on network parameters.
Abstract
We study the advantages of quantum strategies in evolutionary social dilemmas on evolving random networks. We focus our study on the two-player games: prisoner's dilemma, snowdrift and stag-hunt games. The obtained result show the benefits of quantum strategies for the prisoner's dilemma game. For the other two games, we obtain regions of parameters where the quantum strategies dominate, as well as regions where the classical strategies coexist.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
