Evolution of strategies based on genetic algorithm in the iterated prisoner's dilemma on complex networks

MaRDI QIDQ3512918zbMATH OpenFDO

Authors

Publication date 6 August 2008

zbMATH Keywords

complex networkgenetic algorithmevolutionary gamecooperation strategy

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Cooperative games (91A12)

Recommendations

• scientific article; zbMATH DE number 1189212
• Evolutionary aspects of spatial prisoner's dilemma in a population modeled by continuous probabilistic cellular automata and genetic algorithm.
• Cooperation enhanced by the `survival of the fittest' rule in prisoner's dilemma games on complex networks
• Co-evolution of strategies and update rules in the prisoner's dilemma game on complex networks
• Evolutionary games and self-organizing cooperation

Cited in

(8)

• Adaptation using hybridized genetic crossover strategies
• Evolutionary aspects of spatial prisoner's dilemma in a population modeled by continuous probabilistic cellular automata and genetic algorithm.
• Evolution of cooperation in Axelrod tournament using cellular automata
• Memory does not necessarily promote cooperation in dilemma games
• Cooperation enhanced by the `survival of the fittest' rule in prisoner's dilemma games on complex networks
• Can remembering history from predecessor promote cooperation in the next generation?
• A study of prisoner's dilemma game model with incomplete information
• scientific article; zbMATH DE number 1189212 (Why is no real title available?)

This page was built for publication: Evolution of strategies based on genetic algorithm in the iterated prisoner's dilemma on complex networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512918)