Giannakis, K.; Theocharopoulou, G.; Papalitsas, C.; Fanarioti, S.; Andronikos, T. Quantum Conditional Strategies and Automata for Prisoners’ Dilemmata under the EWL Scheme. Appl. Sci.2019, 9, 2635.
Giannakis, K.; Theocharopoulou, G.; Papalitsas, C.; Fanarioti, S.; Andronikos, T. Quantum Conditional Strategies and Automata for Prisoners’ Dilemmata under the EWL Scheme. Appl. Sci. 2019, 9, 2635.
Classic game theory is an important field with a long tradition of useful results. Recently, the quantum versions of classical games, such as the Prisoner's Dilemma (PD), have attracted a lot of attention. Similarly, state machines and specifically finite automata have also been under constant and thorough study for plenty of reasons. The quantum analogues of these abstract machines, like the quantum finite automata, have been studied extensively. In this work, we examine some well-known game conditional strategies that have been studied within the framework of the repeated PD game. Then, we try to associate these strategies to proper quantum finite automata that receive them as inputs and recognize them with probability 1, achieving some interesting results. We also study the quantum version of PD under the Eisert-Wilkens-Lewenstein scheme, proposing a novel conditional strategy for the repeated version of this game.
MATHEMATICS & COMPUTER SCIENCE, General & Theoretical Computer Science
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.