Metraipolis › archive › dc_35613eb24bcf

Peace war game — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Peace_war_game
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T14:35:08.821Z
SHA-256 of the archived text
018106b8477891ed5324c53114f48493bf2119c2c641729e0d4d4d13f6514709
Stable URL of this page
https://metraipolis.com/documento/dc_35613eb24bcf

How to cite

Peace war game — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Peace_war_game (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_35613eb24bcf (Metraipolis archive dc_35613eb24bcf, sha256 018106b8477891ed5324c53114f48493bf2119c2c641729e0d4d4d13f6514709)
BibTeX
@misc{dc35613eb24bcf,
  title = {Peace war game — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Peace_war_game},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_35613eb24bcf; sha256 018106b8477891ed5324c53114f48493bf2119c2c641729e0d4d4d13f6514709},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Peace_war_game. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Peace war game is an iterated game originally played in academic groups and by computer simulation for years to study possible strategies of cooperation and aggression. As peace makers became richer over time it became clear that making war had greater costs than initially anticipated. The only strategy that acquired wealth more rapidly was a constant aggressor making war continually to gain resources. This led to the development of the "provokable nice guy" strategy, a peace-maker until attacked. Multiple players continue to gain wealth cooperating with each other while bleeding the constant aggressor. The peace war game is a variation of the iterated prisoner's dilemma in which the decisions (Cooperate, Defect) are replaced by (Peace, War). Strategies remain the same with reciprocal altruism, also known as "Tit for Tat" or "provokable nice guy", as the best deterministic one. This strategy is simply to make peace on the first iteration of the game; after that, the player does what his opponent did on the previous move. A slightly better strategy is "Tit for Tat with forgiveness". When the opponent makes war, on the next move, the player sometimes makes peace anyway, with a small probability. This allows an escape from wasting cycles of retribution, a motivation similar to the Rule of Ko in the game of Go. "Tit for Tat with forgiveness" is best when miscommunication is introduced, when one's move is incorrectly reported to the opponent. A typical payoff matrix for two players (A, B) of one iteration of this game is: Here a player's resources have a value of 2, half of which must be spent to wage war. In this case, there exists a Nash equilibrium, a mutually best response for a single iteration, here (War, War), by definition heedless of consequences in later iterations. "Provokable nice guy's" optimality depends on iterations. How many are necessary is likely tied to the payoff matrix and probabilities of choosing. A subgame perfect version of this strategy is "Contrite Tit-for-Tat" which is to make peace unless one is in "good standing" and one's opponent is not. Good ("standing" assumed) means to make peace with good opponents, make peace when bad, or make war when good and opponent is not.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «game theory»).
Fonte: Wikipedia in inglese, voce «Peace war game» — https://en.wikipedia.org/wiki/Peace_war_game
Wikidata Q10860202 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q10860202
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Peace_war_game?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1357956752, consultata il 2026-10-07T14:09:46.145Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 5f76a7c626282eab311d36b26ca877c6279714a277e1598d3e9d9caf2913fdf2