Tit-for-Tat

Tit-for-tat is a simple conditional-cooperation strategy associated with the study of the iterated Prisoner's Dilemma. The rule has two parts: cooperate on the first round, then in every subsequent round do whatever the other player did last round. Despite its simplicity, the strategy became famous after Robert Axelrod's computer tournaments, reported in his 1984 book The Evolution of Cooperation, in which a tit-for-tat program submitted by Anatol Rapoport won both rounds against more elaborate entries.

Axelrod attributed the strategy's success to four properties:

• Niceness — it is never the first to defect.
• Retaliation — it punishes defection immediately, so it is not exploitable by purely selfish strategies.
• Forgiveness — it returns to cooperation as soon as the opponent does, preventing endless feuds.
• Clarity — the rule is easy for opponents to recognize and adapt to.

In international relations theory, tit-for-tat is used as a microfoundation for arguments about how cooperation can emerge under anarchy without a central enforcer. Realists and institutionalists alike draw on it: Kenneth Oye's edited volume Cooperation under Anarchy (1986) and Robert Keohane's After Hegemony (1984) both invoke iterated reciprocity to explain why states honor agreements when the "shadow of the future" is long. The strategy underlies analyses of arms control verification, trade retaliation under WTO dispute settlement, and reciprocal tariff escalation.

The strategy has known weaknesses. In noisy environments, where actions can be misperceived, a single mistaken defection can trigger a long echo of mutual punishment — the problem Axelrod and others addressed with variants such as tit-for-two-tats and generous tit-for-tat, which forgive occasional defections. It also performs poorly against strategies designed to exploit its predictability or in one-shot interactions where the shadow of the future is absent.