{"_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-1997-the-complexity-of-cooperation-agent-based-models-of-competition-a","urls":{"read":"https://miscsubjects.com/api/articles/paper-axelrod-r-1997-the-complexity-of-cooperation-agent-based-models-of-competition-a/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-1997-the-complexity-of-cooperation-agent-based-models-of-competition-a/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-1997-the-complexity-of-cooperation-agent-based-models-of-competition-a/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-1997-the-complexity-of-cooperation-agent-based-models-of-competition-a/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-1997-the-complexity-of-cooperation-agent-based-models-of-competition-a/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-1997-the-complexity-of-cooperation-agent-based-models-of-competition-a/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-1997-the-complexity-of-cooperation-agent-based-models-of-competition-a/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-1997-the-complexity-of-cooperation-agent-based-models-of-competition-a","title":"Axelrod (1997) The Complexity of Cooperation","register":"standard","tags":["oip","philosophy","paper"],"updated_at":"2026-07-10T00:47:23.577Z","body_excerpt":"## What the Work Establishes\n\nRobert Axelrod published The Complexity of Cooperation in 1997 as a sequel to his 1984 book The Evolution of Cooperation. The 1997 volume collects seven essays. Each essay uses agent-based models to extend the study of cooperation beyond simple two-player repeated games.\n\nThe core method places autonomous agents on a grid or network. Each agent follows a simple strategy rule. Agents interact locally with neighbors. Over repeated rounds, successful strategies increase in frequency through imitation or selection.\n\nThis approach demonstrates that global patterns of cooperation, competition, and cultural similarity emerge from local rules without central direction.\n\n## Core Results\n\nAgent-based simulations produce stable clusters of cooperators. They also produce waves of strategy change and occasional chaotic fluctuations in strategy frequencies.\n\nOne model shows how norms spread when agents punish defectors and observe neighbors. Another model shows how cultural traits converge within local groups while diversity persists across larger scales.\n\nA third model examines the evolution of strategies when agents can choose partners or exit interactions.\n\nThese results hold across multiple runs when parameters such as interaction radius, mutation rate, and payoff values stay within tested ranges.\n\n## Primary Works and Passages\n\nThe 1997 book reprints essays originally published between 1986 and 1995. No single page number contains a universal summary quote because the volume is a collection.\n\nThe introduction states the dual purpose of the title: adding complexity to cooperation studies and showing that cooperation itself is complex.\n\nOne essay on the dissemination of culture contains the statement that local convergence plus occasional long-range interaction produces both homogeneity within regions and persistent global diversity.\n\nA claim about exact wording carries the tier anecdotal because it rests on secondary summaries rather than direct page verification in this response.\n\n## Convergence Patterns Evidenced\n\nThe models generate flow networks of strategy adoption. They generate bounded chaos in the form of intermittent shifts between cooperation and defection phases. They generate scale-invariant cluster sizes in some parameter regimes. They generate memory in the form of persistent local norms once established.\n\nThese patterns arise from repeated local interactions that the models treat as object invocations. The ledger of successful strategies functions as a distributed record. Successful strategies replay across the population.\n\nThe work therefore touches the grain described in the OIP synthesis: reliable local rules produce a narrow family of structural patterns.\n\n## Relation to the OIP/GRAIN Synthesis\n\nThe models supply mechanistic evidence that difference in strategy payoffs drives flow of imitation. Flow produces structure in the form of cooperator clusters. Structure stores memory as stable norms. The process stops short of life or mind.\n\nThe reader of the simulation observes the emergent patterns from outside the model. This places the observer outside rather than inside the system. The work therefore reaches the structure and memory layers of the Ladder but does not address the Mirror Layer.\n\nSibling article /a/oip-the-ladder carries the full Ladder description. Sibling article /a/oip-the-mirror-layer carries the inside-system requirement.\n\n## Honest Limits\n\nThe models remain abstractions. They omit many real-world factors such as resource constraints, power asymmetries, and institutional enforcement.\n\nSome game theorists criticize the approach for producing results sensitive to arbitrary parameter choices. The simulations do not prove that observed social patterns must arise this way in every human population.\n\nThe distance from the full synthesis remains large. The work supplies no account of how simulation patterns would scale to individual self-reference or collective mind.\n\nA reduction","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[{"id":"c2","text":"Local interaction rules in the models produce stable cooperator clusters and waves of strategy change.","tier":"mechanistic","weight":0.3,"section":"Core Results","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Demonstrates emergence of structure from local rules.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true},{"id":"c3","text":"The models generate flow networks, bounded chaos, and memory in the form of persistent norms.","tier":"mechanistic","weight":0.3,"section":"Convergence Patterns Evidenced","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Links directly to grain patterns in the synthesis.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true},{"id":"c1","text":"The 1997 volume collects seven essays that use agent-based models to study cooperation.","tier":"anecdotal","weight":0.3,"section":"What the Work Establishes","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the method and scope of the work.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true},{"id":"c5","text":"No human-subject data appear in the volume; all results are computational.","tier":"anecdotal","weight":0.3,"section":"What the Evidence Actually Shows","slot":null,"interaction_risk":false,"status":"active","source_ids":["s1"],"source_status":"sourced","why_material":"States the evidential limit plainly.","retracted_at":null,"retraction_reason":null,"challenged_by":[],"effective_weight":0.22,"quote_gated":true}],"sources":[{"id":"s1","type":"other","url":"https://en.wikipedia.org/wiki/The_Complexity_of_Cooperation","title":"The Complexity of Cooperation - Wikipedia","quote":"The Complexity of Cooperation, by Robert Axelrod, is the sequel to The Evolution of Cooperation. It is a compendium of seven articles...","summary":"Confirms publication details, structure as essay collection, and focus on agent-based models extending Prisoner's Dilemma work.","claim_ids":["c1","c2","c3","c5"],"link_status":"ok","quote_status":"unverified","hash":"8187bda0cbcc8fe83a27a3a0c3374d2164c81045406a7246546957f3c1eceedc"}],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"questions":[],"evidence":[],"edges":[],"error":"question graph tables missing"},"honesty":{"active_claims":4,"retracted_claims":0,"cut_claims":1,"challenges":0,"scrub_events":0,"note":"Retracted/cut claims stay on ledger but are excluded from ask unless ?include_inactive=1"},"counts":{"claims":4,"claims_total":5,"sources":1,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}