Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game
From MaRDI portal
Publication:1657268
DOI10.3390/math6020020zbMath1457.91124OpenAlexW2765739509MaRDI QIDQ1657268
Alla Sirokofskich, Alexander Singh, Konstantinos Giannakis, Magdalini Varvouzou, Kalliopi Kastampolidou, Theodore Andronikos
Publication date: 13 August 2018
Published in: Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/math6020020
2-person games (91A05) Formal languages and automata (68Q45) Algorithmic game theory and complexity (91A68) Quantum games (91A81)
Related Items (2)
The distributed Kolkata paise restaurant game ⋮ Conditions that enable a player to surely win in sequential quantum games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum strategies
- Lower bounds on the size of semi-quantum finite automata
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Promise problems solved by quantum and classical finite automata
- Gurevich-Harrington's games defined by finite automata
- Quantum game of two discriminable coins
- Finite automata play the repeated prisoner's dilemma
- Evolutionary stability in repeated games played by finite automata
- An invitation to quantum game theory
- Parrondo games as lattice gas automata
- Unary probabilistic and quantum automata on promise problems
- Repeated games with finite automata
- On hybrid models of quantum finite automata
- Quantum strategic game theory
- INVESTIGATION OF QUANTUM ROULETTE
- The Structure of Nash Equilibrium in Repeated Games with Finite Automata
- Quantum Games and Quantum Strategies
- A new protocol and lower bounds for quantum coin flipping
This page was built for publication: Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game
