1,856 research outputs found
Evolution Reinforces Cooperation with the Emergence of Self-Recognition Mechanisms: an empirical study of the Moran process for the iterated Prisoner's dilemma
We present insights and empirical results from an extensive numerical study
of the evolutionary dynamics of the iterated prisoner's dilemma. Fixation
probabilities for Moran processes are obtained for all pairs of 164 different
strategies including classics such as TitForTat, zero determinant strategies,
and many more sophisticated strategies. Players with long memories and
sophisticated behaviours outperform many strategies that perform well in a two
player setting. Moreover we introduce several strategies trained with
evolutionary algorithms to excel at the Moran process. These strategies are
excellent invaders and resistors of invasion and in some cases naturally evolve
handshaking mechanisms to resist invasion. The best invaders were those trained
to maximize total payoff while the best resistors invoke handshake mechanisms.
This suggests that while maximizing individual payoff can lead to the evolution
of cooperation through invasion, the relatively weak invasion resistance of
payoff maximizing strategies are not as evolutionarily stable as strategies
employing handshake mechanisms
Reinforcement Learning Produces Dominant Strategies for the Iterated Prisoner's Dilemma
We present tournament results and several powerful strategies for the
Iterated Prisoner's Dilemma created using reinforcement learning techniques
(evolutionary and particle swarm algorithms). These strategies are trained to
perform well against a corpus of over 170 distinct opponents, including many
well-known and classic strategies. All the trained strategies win standard
tournaments against the total collection of other opponents. The trained
strategies and one particular human made designed strategy are the top
performers in noisy tournaments also
Understanding collaboration in volunteer computing systems
Volunteer computing is a paradigm in which devices participating in a distributed environment share part of their resources to help others perform their activities. The effectiveness of this computing paradigm depends on the collaboration attitude adopted by the participating devices. Unfortunately for software designers it is not clear how to contribute with local resources to the shared environment without compromising resources that could then be required by the contributors. Therefore, many designers adopt a conservative position when defining the collaboration strategy to be embedded in volunteer computing applications. This position produces an underutilization of the devices’ local resources and reduces the effectiveness of these solutions. This article presents a study that helps designers understand the impact of adopting a particular collaboration attitude to contribute with local resources to the distributed shared environment. The study considers five collaboration strategies, which are analyzed in computing environments with both, abundance and scarcity of resources. The obtained results indicate that collaboration strategies based on effort-based incentives work better than those using contribution-based incentives. These results also show that the use of effort-based incentives does not jeopardize the availability of local resources for the local needs.Peer ReviewedPostprint (published version
Quantum Games and Quantum Strategies
We investigate the quantization of non-zero sum games. For the particular
case of the Prisoners' Dilemma we show that this game ceases to pose a dilemma
if quantum strategies are allowed for. We also construct a particular quantum
strategy which always gives reward if played against any classical strategy.Comment: 4 pages, 4 figures, typographic sign error in the definition of the
operator J correcte
- …