A Predictive Strategy for the Iterated Prisoner's Dilemma

09/03/2020
by   Robert Prentner, et al.
0

The iterated prisoner's dilemma is a game that produces many counter-intuitive and complex behaviors in a social environment, based on very simple basic rules. It illustrates that cooperation can be a good thing even in a competitive world, that individual fitness needs not to be the most important criteria of success, and that some strategies are very strong in a direct confrontation but could still perform poorly on average or are evolutionarily unstable. In this contribution, we present a strategy – PREDICTOR – which appears to be "sentient" and chooses to cooperate when playing against some strategies, but defects when playing against others, without the need to record "tags" for its opponents or an involved decision-making mechanism. To be able to operate in the highly-contextual environment, as modeled by the iterated prisoner's dilemma, PREDICTOR learns from its experience to choose optimal actions by modeling its opponent and predicting a (fictive) future. It is shown that PREDICTOR is an efficient strategy for playing the iterated prisoner's dilemma and is simple to implement. In a simulated and representative tournament, it achieves high average scores and wins the tournament for various parameter settings. PREDICTOR thereby relies on a brief phase of exploration to improve its model, and it can evolve morality from intrinsically selfish behavior.

READ FULL TEXT

page 12

page 13

research
04/28/2017

The Impact of Coevolution and Abstention on the Emergence of Cooperation

This paper explores the Coevolutionary Optional Prisoner's Dilemma (COPD...
research
12/18/2017

Invincible Strategies of Iterated Prisoner's Dilemma

Iterated Prisoner's Dilemma(IPD) is a well-known benchmark for studying ...
research
02/21/2023

Learning signatures of decision making from many individuals playing the same game

Human behavior is incredibly complex and the factors that drive decision...
research
03/22/2022

What can we Learn Even From the Weakest? Learning Sketches for Programmatic Strategies

In this paper we show that behavioral cloning can be used to learn effec...
research
10/15/2018

Hedging Algorithms and Repeated Matrix Games

Playing repeated matrix games (RMG) while maximizing the cumulative retu...
research
04/18/2023

Playing it safe: information constrains collective betting strategies

Every interaction of a living organism with its environment involves the...
research
11/24/2020

The Cost of Simple Bidding in Combinatorial Auctions

We study the complexity of bidding optimally in one-shot combinatorial a...

Please sign up or login with your details

Forgot password? Click here to reset