AN OPTIMAL STRATEGY CREATION IN THE ITERATED PRISONER'S DILEMMA AGAINST THE FIXED SET OF ENEMIES

M. . Pinsky, D. . Stepanov


Read the full article 

Abstract

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.


Keywords: iterated prisoner's dilemma, finite automata, genetic algorithms, ZD-strategy

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Copyright 2001-2018 ©
Scientific and Technical Journal
of Information Technologies, Mechanics and Optics.
All rights reserved.

Яндекс.Метрика