EFFECTIVE CHOICE IN THE SINGLE-SHOT PRISONERS-DILEMMA TOURNAMENT

This paper discusses the results of a single-shot Prisoner's Dilemma c omputer tournament. In the single-shot Prisoner's Dilemma tournament e ach pair of players interacts only once. But players can establish and detect reputations because they know how their current opponent has b ehaved in previous games with other players. The results show that coo peration is worthwhile, even in single-shot games, provided the outcom es of previous games are common knowledge.