An analytical framework for the Prisoner’s Dilemma: Finite state machine representation for interactions between deterministic strategies
From MaRDI portal
Publication:4465489
Recommendations
- Universal Computation in the Prisoner’s Dilemma Game
- Iterated prisoner's dilemma contains strategies that dominate any evolutionary opponent
- scientific article; zbMATH DE number 2162236
- Preference and evolution in the iterated prisoner's dilemma
- Evolutionary dynamics of the spatial prisoner's dilemma with single and multi-behaviors: a multi-agent application
Cites work
- scientific article; zbMATH DE number 3835792 (Why is no real title available?)
- Evolutionary dynamics of spatial games
- Finite automata play repeated prisoner's dilemma with information processing costs
- Game-dynamical aspects of the prisoner's dilemma
- Promoting cooperation using `kin' biased conditional strategy in the iterated prisoner's dilemma game
- The evolution of stochastic strategies in the prisoner's dilemma
This page was built for publication: An analytical framework for the Prisoner’s Dilemma: Finite state machine representation for interactions between deterministic strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4465489)