Conditions that enable a player to surely win in sequential quantum games

This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing this class of games. The main conclusion of this paper is that the specific rules of a game are absolutely critical. The slightest variation in the rules may have important impact on the outcome of the game. This work demonstrates that it is the combination of two factors that determines who wins: (i) the sets of admissible moves for each player, and (ii) the order of moves, i.e., whether the same player makes the first and the last move. Quantum strategies do not a priori prevail over classical strategies. By carefully designing the rules of the game it is equally feasible either to guarantee the fairness of the game, or to give the advantage to either player.

[1]  T. Andronikos,et al.  A Survey of Evolutionary Games in Biology. , 2020, Advances in experimental medicine and biology.

[2]  David A. Meyer,et al.  Parrondo Games as Lattice Gas Automata , 2001 .

[3]  Leong Chuan Kwek,et al.  Quantum roulette: an extended quantum strategy , 2000 .

[4]  Theodore Andronikos,et al.  Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game , 2018 .

[5]  B. Hall Quantum Theory for Mathematicians , 2013 .

[6]  A. Rubinstein,et al.  The Structure of Nash Equilibrium in Repeated Games with Finite Automata (Now published in Econometrica, 56 (1988), pp.1259-1282.) , 1986 .

[7]  A. Rubinstein Finite automata play the repeated prisoner's dilemma , 1986 .

[8]  Hong Gao,et al.  Quantum gambling based on Nash-equilibrium , 2014 .

[9]  Cyrille Bertelle,et al.  ADAPTIVE BEHAVIOUR FOR PRISONER DILEMMA STRATEGIES BASED ON AUTOMATA WITH MULTIPLICITIES , 2002 .

[10]  A. Neyman Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma , 1985 .

[11]  N. Aharon,et al.  Quantum dice rolling: a multi-outcome generalization of quantum coin flipping , 2009, 0909.4186.

[12]  Theodore Andronikos,et al.  Dominant Strategies of Quantum Games on Quantum Periodic Automata , 2015, Comput..

[13]  S. Salimi,et al.  INVESTIGATION OF QUANTUM ROULETTE , 2008, 0807.3142.

[14]  Theodore Andronikos,et al.  Elements of Game Theory in a Bio-inspired Model of Computation , 2019, 2019 10th International Conference on Information, Intelligence, Systems and Applications (IISA).

[15]  Colin Benjamin,et al.  Do quantum strategies always win? , 2015, Quantum Inf. Process..

[16]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[17]  Qing-Liang Wang,et al.  Quantum Game of Two Discriminable Coins , 2008 .

[18]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[19]  J. Eisert,et al.  Quantum Games and Quantum Strategies , 1998, quant-ph/9806088.

[20]  Khaled Suwais Assessing the Utilization of Automata in Representing Players' Behaviors in Game Theory , 2014, Int. J. Ambient Comput. Intell..

[21]  H. O. Foulkes Abstract Algebra , 1967, Nature.

[22]  Theodore Andronikos,et al.  Quantum Conditional Strategies and Automata for Prisoners’ Dilemmata under the EWL Scheme , 2019, Applied Sciences.

[23]  Maria Nefeli Nikiforos,et al.  A Brief Survey of the Prisoners' Dilemma Game and Its Potential Use in Biology. , 2020, Advances in experimental medicine and biology.

[24]  John Stillwell,et al.  Naive Lie Theory , 2008 .

[25]  J. Creedy,et al.  Repeated Games and Finite Automata , 2013 .

[26]  Theodore Andronikos,et al.  The connection between the PQ penny flip game and the dihedral groups , 2021, Mathematics.

[27]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[28]  Rüdeger Baumann,et al.  Games of Strategy , 1982 .

[29]  D. Meyer Quantum strategies , 1998, quant-ph/9804010.