Dominant Strategies of Quantum Games on Quantum Periodic Automata
AbstractGame theory and its quantum extension apply in numerous fields that affect people’s social, political, and economical life. Physical limits imposed by the current technology used in computing architectures (e.g., circuit size) give rise to the need for novel mechanisms, such as quantum inspired computation. Elements from quantum computation and mechanics combined with game-theoretic aspects of computing could open new pathways towards the future technological era. This paper associates dominant strategies of repeated quantum games with quantum automata that recognize infinite periodic inputs. As a reference, we used the PQ-PENNY quantum game where the quantum strategy outplays the choice of pure or mixed strategy with probability 1 and therefore the associated quantum automaton accepts with probability 1. We also propose a novel game played on the evolution of an automaton, where players’ actions and strategies are also associated with periodic quantum automata. View Full-Text
Share & Cite This Article
Giannakis, K.; Papalitsas, C.; Kastampolidou, K.; Singh, A.; Andronikos, T. Dominant Strategies of Quantum Games on Quantum Periodic Automata. Computation 2015, 3, 586-599.
Giannakis K, Papalitsas C, Kastampolidou K, Singh A, Andronikos T. Dominant Strategies of Quantum Games on Quantum Periodic Automata. Computation. 2015; 3(4):586-599.Chicago/Turabian Style
Giannakis, Konstantinos; Papalitsas, Christos; Kastampolidou, Kalliopi; Singh, Alexandros; Andronikos, Theodore. 2015. "Dominant Strategies of Quantum Games on Quantum Periodic Automata." Computation 3, no. 4: 586-599.