Repeated Sequential Prisoner's Dilemma: The Stackleberg Variant
From MaRDI portal
Publication:5245844
DOI10.1142/S0217595915400096zbMath1312.91016OpenAlexW2136115542MaRDI QIDQ5245844
Yifen Mu, Zhigang Cao, Xing-long Qu, Xiao-guang Yang
Publication date: 15 April 2015
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595915400096
Hierarchical games (including Stackelberg games) (91A65) 2-person games (91A05) Markov and semi-Markov decision processes (90C40) Rationality and learning in game theory (91A26) Multistage and repeated games (91A20)
Cites Work
- Unnamed Item
- Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
- Finite automata play the repeated prisoner's dilemma
- Subjectivity and correlation in randomized strategies
- Two-person repeated games with finite automata
- Remarks on infinitely repeated extensive-form games
- When is tit-for-tat unbeatable?
- Finitely Repeated Games with Finite Automata
- The Evolution of Cooperation
- Information structure, Stackelberg games, and incentive controllability
- The Folk Theorem in Repeated Games with Discounting or with Incomplete Information
- A Folk Theorem for Repeated Sequential Games
- Evolution of extortion in Iterated Prisoner’s Dilemma games
- From extortion to generosity, evolution in the Iterated Prisoner’s Dilemma