{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_topology","feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","contains":"claims, sources, anecdotes, question_graph slice","slug":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","urls":{"read":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/topology"},"how_to_use":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"graph_topology","name":"Cross-article graph","what":"Merged claims/sources across condition+stack slugs for one question.","urls":{"read":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/graph-topology?question=..."}},{"id":"question_graph","name":"Question graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output).","urls":{"read":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/question-graph","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/voxels","write":"https://miscsubjects.com/api/protocol/claim"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","why":"Every feature is auditable collective intelligence","how":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/topology"},"imessage":null,"router":null,"related":[{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"graph_topology","what":"Merged claims/sources across condition+stack slugs for one question."},{"id":"question_graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output)."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."}],"not_medical_advice":true},"slug":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","title":"Axelrod 1984 The Evolution of Cooperation","register":"standard","tags":["oip","philosophy","paper"],"updated_at":"2026-07-10T00:48:21.337Z","body_excerpt":"## What the subject saw and its core results\n\nRobert Axelrod ran computer tournaments of the iterated Prisoner's Dilemma. Players submitted strategies as programs. Each strategy played every other strategy many times. Payoffs rewarded mutual cooperation and punished mutual defection. The winner in the first tournament and again in the second was Tit for Tat. Tit for Tat starts by cooperating. It then copies the opponent's previous move.\n\nThis result showed that cooperation can emerge and persist among egoistic agents when interactions repeat and the shadow of the future matters. No central authority is required. Simple reciprocity suffices.\n\n## Exact primary works and passages\n\nThe work is Axelrod, R. (1984). The Evolution of Cooperation. Basic Books.\n\nKey passages include: \"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.\" (Chapter 2, tournament description).\n\n\"What accounts for TIT-FOR-TAT's robust success is its combination of being nice, retaliatory, forgiving and clear.\" (p. 54).\n\n\"The conditions for the evolution of cooperation tell what is necessary, but do not, by themselves, tell what strategies will be most successful. For this question, the tournament approach has offered striking evidence in favor of the robust success of the simplest of all discriminating strategies: TIT FOR TAT.\" (Chapter 1 and conclusions).\n\n\"TIT FOR TAT is merely the strategy of starting with cooperation, and thereafter doing what the other player did on the previous move.\" (Tournament analysis sections).\n\n## Convergence patterns the work touches\n\nThe tournaments evidence symmetry through direct reciprocity. Memory appears in the single-move history that Tit for Tat retains. Scale invariance shows in the shift from small tournaments to ecological simulations where successful strategies increase in frequency across generations. Flow networks appear in the repeated pairwise interactions that allow payoffs to accumulate over time. Bounded chaos is present in the way initial conditions and strategy mixes determine whether cooperation spreads or collapses.\n\n## Distance from the full synthesis\n\nThe work maps difference (defect versus cooperate choice) to flow (repeated games) to structure (emergent cooperation norms) to memory (strategy state). It stops short of life and mind. It provides no direct link to energy flows or thermodynamic patterns. The Ladder connection holds only up to social memory in repeated interactions.\n\nSee /a/oip-the-ladder for the full sequence. See /a/oip-principles for object invocation rules that parallel strategy stability.\n\n## Honest limits and disconfirming edges\n\nThe model assumes fixed payoff matrices and perfect recall of the last move. Real agents face noisy observations and changing payoffs. The tournaments do not model spatial structure or multi-level selection beyond simple ecology. A reductionist account notes that the results depend on the specific discount parameter w for future payoffs; low w collapses cooperation. The work remains silent on how such strategies arise in physical systems without prior programming.\n\n## Claims\n\nThe body text above atomizes into the claims array below.\n\n## What the evidence actually shows\n\nSimulation data establish that Tit for Tat outscores alternatives under repeated play. Five of six variant tournaments and generational ecology runs confirm the ranking. These outcomes rest on the four properties: niceness, retaliatory response, forgiveness after one defect, and clarity.\n\n## What scientists say\n\nLater analyses confirm the four properties drive success across many payoff matrices when w exceeds a threshold. The original tournaments remain the primary evidence base.\n\n## What people say on Reddit\n\nDiscussions note that Tit for Tat exploits the opponent's own logic and remains simple enough to be understood by other pr","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[{"id":"c5","text":"The model contains no direct account of energy flows or thermodynamic constraints.","tier":"anecdotal","weight":0.3,"section":"Honest limits and disconfirming edges","slot":"limitations","interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"States the precise distance from the full GRAIN synthesis.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.3,"quote_gated":false},{"id":"c3","text":"The four properties of niceness, retaliatory response, forgiveness, and clarity explain Tit for Tat success.","tier":"mechanistic","weight":0.3,"section":"What the evidence actually shows","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Identifies the invariants that allow the pattern to persist across strategy mixes.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true},{"id":"c4","text":"Cooperation emerges from egoistic agents under repeated interactions with sufficient future weight.","tier":"mechanistic","weight":0.3,"section":"Convergence patterns the work touches","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Supports the synthesis claim that memory and flow produce structure without central control.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true},{"id":"c1","text":"Tit for Tat starts by cooperating and then copies the opponent's previous move.","tier":"anecdotal","weight":0.3,"section":"Exact primary works and passages","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the core mechanism that produces cooperation in the model.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true},{"id":"c2","text":"Tit for Tat won both rounds of the computer tournaments of the iterated Prisoner's Dilemma.","tier":"anecdotal","weight":0.3,"section":"What the subject saw and its core results","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the empirical result grounding claims about emergent cooperation.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true}],"sources":[{"id":"s1","type":"other","url":"https://ee.stanford.edu/~hellman/Breakthrough/book/pdfs/axelrod.pdf","title":"The Evolution of Cooperation by Robert Axelrod","quote":"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.","summary":"Primary source PDF containing tournament descriptions and results.","claim_ids":["c1","c2","c3","c4","c5"],"link_status":"ok","quote_status":"unverified","hash":"e32eb4190a65f20578549c742f75d922d1d525c7e6caa3d8793e76942b766dcf"}],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"questions":[],"evidence":[],"edges":[],"error":"question graph tables missing"},"honesty":{"active_claims":5,"retracted_claims":0,"cut_claims":0,"challenges":0,"scrub_events":0,"note":"Retracted/cut claims stay on ledger but are excluded from ask unless ?include_inactive=1"},"counts":{"claims":5,"claims_total":5,"sources":1,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}