Next Article in Journal
An Incompressible, Depth-Averaged Lattice Boltzmann Method for Liquid Flow in Microfluidic Devices with Variable Aperture
Previous Article in Journal
A Comparative Density Functional Theory and Density Functional Tight Binding Study of Phases of Nitrogen Including a High Energy Density Material N8
Article Menu

Export Article

Open AccessArticle
Computation 2015, 3(4), 586-599; doi:10.3390/computation3040586

Dominant Strategies of Quantum Games on Quantum Periodic Automata

Department of Informatics, Ionian University, 7 Tsirigoti Square, Corfu 49100, Greece
These authors contributed equally to this work.
*
Author to whom correspondence should be addressed.
Academic Editor: Demos T. Tsahalis
Received: 29 August 2015 / Accepted: 16 November 2015 / Published: 20 November 2015
(This article belongs to the Section Computational Engineering)
View Full-Text   |   Download PDF [231 KB, uploaded 20 November 2015]   |  

Abstract

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. View Full-Text
Keywords: algorithmic game theory; quantum computing; quantum automata; quantum games algorithmic game theory; quantum computing; quantum automata; quantum games
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. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Giannakis, K.; Papalitsas, C.; Kastampolidou, K.; Singh, A.; Andronikos, T. Dominant Strategies of Quantum Games on Quantum Periodic Automata. Computation 2015, 3, 586-599.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Computation EISSN 2079-3197 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top