{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:26:11Z","timestamp":1760243171868,"version":"build-2065373602"},"reference-count":49,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T00:00:00Z","timestamp":1447977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>Game theory and its quantum extension apply in numerous fields that affect people\u2019s 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\u2019 actions and strategies are also associated with periodic quantum automata.<\/jats:p>","DOI":"10.3390\/computation3040586","type":"journal-article","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T01:57:02Z","timestamp":1448330222000},"page":"586-599","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Dominant Strategies of Quantum Games on Quantum Periodic Automata"],"prefix":"10.3390","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4199-6708","authenticated-orcid":false,"given":"Konstantinos","family":"Giannakis","sequence":"first","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, Corfu 49100, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0467-796X","authenticated-orcid":false,"given":"Christos","family":"Papalitsas","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, Corfu 49100, Greece"}]},{"given":"Kalliopi","family":"Kastampolidou","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, Corfu 49100, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6263-950X","authenticated-orcid":false,"given":"Alexandros","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, Corfu 49100, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3741-1271","authenticated-orcid":false,"given":"Theodore","family":"Andronikos","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 7 Tsirigoti Square, Corfu 49100, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Colman, A.M. (2013). Game Theory and Its Applications: In the Social and Biological Sciences, Psychology Press.","DOI":"10.4324\/9780203761335"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02650179","article-title":"Simulating physics with computers","volume":"21","author":"Feynman","year":"1982","journal-title":"Int. J. Theor. Phys."},{"key":"ref_3","unstructured":"Feynman, R.P., Hey, J., and Allen, R.W. (1998). Feynman Lectures on Computation, Addison-Wesley Longman Publishing Co., Inc."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.3390\/e14101939","article-title":"Programming unconventional computers: Dynamics, development, self-reference","volume":"14","author":"Stepney","year":"2012","journal-title":"Entropy"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2066","DOI":"10.3390\/e14112066","article-title":"Unconventional algorithms: Complementarity of axiomatics and construction","volume":"14","author":"Burgin","year":"2012","journal-title":"Entropy"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Bernstein, E., and Vazirani, U. (1993, January 16\u201318). Quantum complexity theory. Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, San Diego, CA, USA.","DOI":"10.1145\/167088.167097"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/S0304-3975(01)00377-2","article-title":"One complexity theorist\u2019s view of quantum computing","volume":"292","author":"Fortnow","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"ref_8","first-page":"669","article-title":"Universality in quantum computation","volume":"449","author":"Deutsch","year":"1995","journal-title":"Proc. R. Soc. Lond. Ser. A Math. Phys. Sci."},{"key":"ref_9","first-page":"553","article-title":"Rapid solution of problems by quantum computation","volume":"439","author":"Deutsch","year":"1992","journal-title":"Proc. R. Soc. Lond. Ser. A Math. Phys. Sci."},{"key":"ref_10","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 1994 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","article-title":"Quantum mechanics helps in searching for a needle in a haystack","volume":"79","author":"Grover","year":"1997","journal-title":"Phys. Rev. Lett."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1137\/S0097539796298637","article-title":"On the power of quantum computation","volume":"26","author":"Simon","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_13","unstructured":"Kondacs, A., and Watrous, J. (1997, January 20\u201322). On the power of quantum finite state automata. Proceedings of the 1997 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, USA."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","article-title":"Quantum automata and quantum grammars","volume":"237","author":"Moore","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"ref_15","unstructured":"Dodis, Y., and Rabin, T. (2007). Algorithmic Game Theory, Cambridge University Press."},{"key":"ref_16","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"R175","DOI":"10.1142\/S0219477502000981","article-title":"An introduction to quantum game theory","volume":"2","author":"Flitney","year":"2002","journal-title":"Fluct. Noise Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0304-3975(02)00138-X","article-title":"Two-way finite automata with quantum and classical states","volume":"287","author":"Ambainis","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"ref_19","unstructured":"Hirvensalo, M. (2008). Developments in Language Theory, Springer."},{"key":"ref_20","unstructured":"Hirvensalo, M. (2011). Algebraic Foundations in Computer Science, Springer."},{"key":"ref_21","unstructured":"Say, A.C., and Yakary\u0131lmaz, A. (2014). Computing with New Resources, Springer."},{"key":"ref_22","unstructured":"Dzelme-B\u0113rzi\u0146a, I. (2010). Unconventional Computation, Springer."},{"key":"ref_23","unstructured":"Kreyszig, E. (1989). Introductory Functional Analysis with Applications, Wiley."},{"key":"ref_24","first-page":"389","article-title":"Languages, Automata, and Logic","volume":"Volume III","author":"Rozenberg","year":"1996","journal-title":"Handbook of Formal Languages"},{"key":"ref_25","unstructured":"Thomas, W. (1990). Handbook of Theoretical Computer Science, MIT Press. Volume B: Formal Models and Semantics."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0165-1765(85)90026-6","article-title":"Bounded complexity justifies cooperation in the finitely repeated prisoners\u2019 dilemma","volume":"19","author":"Neyman","year":"1985","journal-title":"Econ. Lett."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0022-0531(86)90021-9","article-title":"Finite automata play the repeated prisoner\u2019s dilemma","volume":"39","author":"Rubinstein","year":"1986","journal-title":"J. Econ. Theory"},{"key":"ref_28","first-page":"1259","article-title":"The structure of Nash equilibrium in repeated games with finite automata","volume":"56","author":"Abreu","year":"1988","journal-title":"Econom. J. Econom. Soc."},{"key":"ref_29","unstructured":"L\u00f6ding, C. (2011). Lectures in Game Theory for Computer Scientists, Cambridge University Press."},{"key":"ref_30","unstructured":"L\u00f6ding, C. (1998). Methods for the Transformation of \u03c9-Automata: Complexity and Connection to Second Order Logic. [Ph.D. Thesis, Christian-Albrechts-University of Kiel]."},{"key":"ref_31","unstructured":"Thomas, W., Wilke, T., and Gr\u00e4del, E. (2002). Automata, Logics, and Infinite Games: A Guide to Current Research, Springer Science & Business Media."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0022-0531(92)90037-I","article-title":"Evolutionary stability in repeated games played by finite automata","volume":"57","author":"Binmore","year":"1992","journal-title":"J. Econ. Theory"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0165-1889(94)00848-1","article-title":"Finite automata play repeated prisoner\u2019s dilemma with information processing costs","volume":"20","author":"Ho","year":"1996","journal-title":"J. Econ. Dyn. Control"},{"key":"ref_34","unstructured":"Ambainis, A., and Yakaryilmaz, A. (2015). Automata and quantum computing, arXiv preprint arXiv:1507.01988."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1023\/A:1014566822448","article-title":"Parrondo games as lattice gas automata","volume":"107","author":"Meyer","year":"2002","journal-title":"J. Stat. Phys."},{"key":"ref_36","unstructured":"Lee, C.F., and Johnson, N. (2012). Parrondo games and quantum algorithms, arXiv preprint quant-ph\/0203043."},{"key":"ref_37","unstructured":"Bertelle, C., Flouret, M., Jay, V., Olivier, D., and Ponty, J.L. (2002, January 23\u201326). Adaptive behaviour for prisoner dilemma strategies based on automata with multiplicities. Proceedings of the 14th European Simulation Symposium and Exhibition, Dresden, Germany."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"3077","DOI":"10.1103\/PhysRevLett.83.3077","article-title":"Quantum games and quantum strategies","volume":"83","author":"Eisert","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"069801","DOI":"10.1103\/PhysRevLett.87.069801","article-title":"Comment on \u201cQuantum Games and Quantum Strategies\u201d","volume":"87","author":"Benjamin","year":"2001","journal-title":"Phys. Rev. Lett."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Zhang, S. (2012, January 8\u201310). Quantum strategic game theory. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, Cambridge, MA, USA.","DOI":"10.1145\/2090236.2090241"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"4423","DOI":"10.1090\/S0002-9939-2011-10838-4","article-title":"Nash equilibria in quantum games","volume":"139","author":"Landsburg","year":"2011","journal-title":"Proc. Am. Math. Soc."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"5171","DOI":"10.1109\/TIT.2013.2258372","article-title":"Efficient protocols for generating bipartite classical distributions and quantum states","volume":"59","author":"Jain","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_43","unstructured":"Jain, R., Wei, Z., Yao, P., and Zhang, S. (2014). Multipartite Quantum Correlation and Communication Complexities, arXiv preprint arXiv:1405.6015."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3390\/e5040313","article-title":"Quantum games: Mixed strategy Nash\u2019s equilibrium represents minimum entropy","volume":"5","year":"2003","journal-title":"Entropy"},{"key":"ref_45","unstructured":"Sorin, S. (2002). A First Course on Zero-Sum Repeated Games, Springer Science & Business Media."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Giannakis, K., Papalitsas, C., and Andronikos, T. (2015, January 6\u20138). Quantum Automata for Infinite Periodic Words. Proceedings of the 6th International Conference on Information, Intelligence, Systems and Applications, IISA 2015, Corfu, Greece.","DOI":"10.1109\/IISA.2015.7388105"},{"key":"ref_47","unstructured":"Meyer, D.A. (2000). Quantum games and quantum algorithms, arXiv preprint quant-ph\/0004092."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1103\/PhysRevLett.82.1052","article-title":"Quantum strategies","volume":"82","author":"Meyer","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"2463","DOI":"10.1098\/rspa.2003.1136","article-title":"Advantage of a quantum player over a classical one in 2 \u00d7 2 quantum games","volume":"459","author":"Flitney","year":"2003","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Eng. Sci."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/3\/4\/586\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:52:31Z","timestamp":1760215951000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/3\/4\/586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,20]]},"references-count":49,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,12]]}},"alternative-id":["computation3040586"],"URL":"https:\/\/doi.org\/10.3390\/computation3040586","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2015,11,20]]}}}