The Iterated Prisoner's Dilemma is an abstract game, with many real examples or near-examples, in which
- Two players repeatedly face a choice of acting generously, called "cooperating", or acting selfishly, called "defecting".
- At any particular turn, they'll both do better if they both cooperate.
- However, if only one cooperates and the other defects at that turn, the cooperator gets shafted.
- Therefore, looking at a particular turn in isolation, the only rational choice is to defect, with the result that both players do less well than if they'd both cooperated.
- However, since the choice is presented repeatedly, players have a chance to base their present actions on the results of previous turns.
To probe this further, Robert Axelrod organized a tournament in which computer programs could compete with each other at the game. The tournament attracted considerable interest, and there were many competitors, some quite sophisticated in design.
And now the payoff: The winner, Anatol Rapaport's "tit-for-tat", consisted of four lines. Of BASIC. Its logic was:
- Cooperate on the first turn.
- After that, do whatever the other player did on the last turn.
In a later edition of the tournament, a team from Southampton University was able to beat tit-for-tat by having multiple copies of its program collude, but that's a different story (and even then who won depends on how you measure).
1 comment:
Basic, f'crisake! How cool is that?
Post a Comment