Alexandros Singh

Alexandros Singh

Auto-generated profile, based on publicly available information

Alexandros Singh

Department of Informatics, Ionian University, 7 Tsirigoti square, Corfu 49100, Greece

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2018 in Mathematics
Verified
Journal Article
Open access
TATheodore Andronikos
Theodore Andronikos
ASAlla Sirokofskich
Alla Sirokofskich
KKKalliopi Kastampolidou
Kalliopi Kastampolidou
MVMagdalini Varvouzou
Magdalini Varvouzou
Konstantinos GiannakisKonstantinos Giannakis
Konstantinos Giannakis
ASAlexander Singh
Alexander Singh
The meticulous study of finite automata has produced many important and useful results. Automata are simple yet efficient finite state machines that can be utilized in a plethora of situations. It comes, therefore, as no surprise that they have been used in classic game theory in order to model players and their actions. Game theory has recently been influenced by ideas from the field of quantum computation. As a result, quantum versions of classic games have already been introduced and studied. The P Q penny flip game is a famous quantum game introduced by Meyer in 1999. In this paper, we investigate all possible finite games that can be played between the two players Q and Picard of the original P Q game. For this purpose, we establish a rigorous connection between finite automata and the P Q game along with all its possible variations. Starting from the automaton that corresponds to the original game, we construct more elaborate automata for certain extensions of the game, before finally presenting a semiautomaton that captures the intrinsic behavior of all possible variants of the P Q game. What this means is that, from the semiautomaton in question, by setting appropriate initial and accepting states, one can construct deterministic automata able to capture every possible finite game that can be played between the two players Q and Picard. Moreover, we introduce the new concepts of a winning automaton and complete automaton for either player.

20 November 2015 in Computation
Verified
Journal Article
Open access
PDF file
Konstantinos GiannakisKonstantinos Giannakis
Konstantinos Giannakis
Christos PapalitsasChristos Papalitsas
Christos Papalitsas
KKKalliopi Kastampolidou
Kalliopi Kastampolidou
ASAlexandros Singh
Alexandros Singh
TATheodore Andronikos
Theodore Andronikos
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.

28 January 2018
Verified
Book Chapter
Closed access
PDF file
ASAlexander Singh
Alexander Singh
DTDimitrios Tsoumakos
Dimitrios Tsoumakos

3 October 2017
Verified
Book Chapter
Closed access
PDF file
ASAlexandros Singh
Alexandros Singh
Konstantinos GiannakisKonstantinos Giannakis
Konstantinos Giannakis
KKKalliopi Kastampolidou
Kalliopi Kastampolidou
Christos PapalitsasChristos Papalitsas
Christos Papalitsas