Dominant Strategies of Quantum Games on Quantum Periodic Automata

Computation

Konstantinos Giannakis¹  Christos Papalitsas¹  Kalliopi Kastampolidou¹  Alexandros Singh¹  Theodore Andronikos¹ 

关键词: algorithmic game theory;    quantum computing;    quantum automata;    quantum games;   

DOI  :  10.3390/computation3040586

来源: mdpi

【 摘 要 】

Game 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.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland.