AN OPTIMAL STRATEGY CREATION IN THE ITERATED PRISONER'S DILEMMA AGAINST THE FIXED SET OF ENEMIES
Read the full article
The article deals with a strategy for iterated prisoner's dilemma, which is gaining maximum points against a fixed set of enemies: classic strategies, ZD-strategy and against itself, providing an evolutionary stability in the given set. A finite automata is given corresponding to the strategy, and the way of its design is described by genetic algorithm.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License