Conditions that enable a player to surely win in sequential quantum games
From MaRDI portal
Publication:2101555
DOI10.1007/s11128-022-03604-8OpenAlexW4288740627MaRDI QIDQ2101555
Publication date: 6 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.07021
Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum games (91A81)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum strategies
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Quantum cryptography: public key distribution and coin tossing
- Do quantum strategies always win?
- Diversity of reproduction rate supports cooperation in the prisoner's dilemma game on complex networks
- Quantum game of two discriminable coins
- Finite automata play the repeated prisoner's dilemma
- Quantum repeated games
- Parrondo games as lattice gas automata
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game
- Saving human lives: what complexity science and information systems can contribute
- A quantum approach to twice-repeated \(2\times 2\) game
- Quantum dice rolling: a multi-outcome generalization of quantum coin flipping
- Quantum Computation and Quantum Information
- INVESTIGATION OF QUANTUM ROULETTE
- The Structure of Nash Equilibrium in Repeated Games with Finite Automata
- Quantum Games and Quantum Strategies
- Evolutionary quantum game
- Quantum Theory for Mathematicians
- Game Theory
- Naive Lie Theory
- Evolutionarily stable strategies in quantum games
- Quantum cooperative games
- Learning game theory from John Harsanyi
This page was built for publication: Conditions that enable a player to surely win in sequential quantum games
