{"id":"ca11cc5b-50d1-4ac0-b741-c3219d17b0b6","entityType":"agent","slug":"clawhub-deciqai-non-zero-sum","name":"Non-Zero-Sum","canonicalUrl":"https://www.xpersona.co/agent/clawhub-deciqai-non-zero-sum","canonicalPath":"/agent/clawhub-deciqai-non-zero-sum","generatedAt":"2026-10-11T14:13:45.420Z","source":"CLAWHUB","claimStatus":"UNCLAIMED","verificationTier":"NONE","summary":{"evidence":{"source":"editorial-content","verified":true,"confidence":"high","updatedAt":"2026-10-11T10:45:24.161Z","emptyReason":null},"description":"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past thi... Skill: Non-Zero-Sum Owner: deciqai Summary: Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past thi... Tags: latest:1.0.5 Version history: v1.0.5 | 2026-07-16T18:08:51.281Z | user Description tail link + agents machine-readable metadata line (deciqai.com/s/non-zero-sum.json) v1.0.4 | 2026-07-09T11:19:17.648Z | user R","descriptionLabel":"Technical summary","evidenceSummary":"Capability contract not published. No trust telemetry is available yet. 1.1K downloads reported by the source. Last updated 10/11/2026.","installCommand":"clawhub skill install s17a4mqcnk515kvaca5ze55d0x88pfpx:non-zero-sum","sourceUrl":"https://clawhub.ai/deciqai/non-zero-sum","homepage":"https://clawhub.ai/deciqai/skills/non-zero-sum","primaryLinks":[{"label":"View on ClawHub","url":"https://clawhub.ai/deciqai/non-zero-sum","kind":"source"},{"label":"Homepage","url":"https://clawhub.ai/deciqai/skills/non-zero-sum","kind":"homepage"}],"safetyScore":84,"overallRank":62,"popularityScore":61,"trustScore":null,"claimedByName":null,"isOwner":false,"seoDescription":"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past thi..."},"coverage":{"evidence":{"source":"public-profile","verified":false,"confidence":"medium","updatedAt":"2026-10-11T10:45:24.161Z","emptyReason":null},"protocols":[{"protocol":"OPENCLEW","label":"OpenClaw","status":"self-declared","notes":"Declared in the public agent profile."}],"capabilities":[],"verifiedCount":0,"selfDeclaredCount":1,"capabilityMatrix":{"rows":[{"key":"OPENCLEW","type":"protocol","support":"unknown","confidenceSource":"profile","notes":"Listed on profile"}],"flattenedTokens":"protocol:OPENCLEW|unknown|profile"}},"adoption":{"evidence":{"source":"CLAWHUB","verified":false,"confidence":"medium","updatedAt":"2026-10-11T10:45:24.161Z","emptyReason":null},"stars":null,"forks":null,"downloads":1084,"packageName":null,"latestVersion":"1.0.5","tractionLabel":"1.1K downloads"},"release":{"evidence":{"source":"CLAWHUB","verified":false,"confidence":"medium","updatedAt":"2026-10-11T10:45:24.098Z","emptyReason":null},"lastUpdatedAt":"2026-10-11T10:45:24.161Z","lastCrawledAt":"2026-10-11T10:45:24.098Z","lastIndexedAt":null,"nextCrawlAt":"2026-10-12T10:45:24.098Z","lastVerifiedAt":null,"highlights":[{"version":"1.0.5","createdAt":"2026-07-16T18:08:51.281Z","changelog":"Description tail link + agents machine-readable metadata line (deciqai.com/s/non-zero-sum.json)","fileCount":6,"zipByteSize":13422},{"version":"1.0.4","createdAt":"2026-07-09T11:19:17.648Z","changelog":"Refresh: 2024-2026 AI-era worked examples added (strategy/leadership + systems/game-theory batch)","fileCount":6,"zipByteSize":13496},{"version":"1.0.3","createdAt":"2026-07-08T11:12:12.955Z","changelog":"Footer now uses /c/<slug> short link (fixes UTM truncation when SKILL.md is read in a terminal)","fileCount":5,"zipByteSize":8686},{"version":"1.0.2","createdAt":"2026-07-08T00:56:58.386Z","changelog":"Refreshed content + GitHub star link in footer","fileCount":5,"zipByteSize":8746},{"version":"1.0.1","createdAt":"2026-07-07T22:30:14.439Z","changelog":"Add catalog categories and topics","fileCount":5,"zipByteSize":8675},{"version":"1.0.0","createdAt":"2026-06-30T13:18:20.204Z","changelog":"Initial publish","fileCount":5,"zipByteSize":8856}]},"execution":{"evidence":{"source":"CLAWHUB","verified":false,"confidence":"low","updatedAt":null,"emptyReason":"No published capability contract is available yet."},"installCommand":"clawhub skill install s17a4mqcnk515kvaca5ze55d0x88pfpx:non-zero-sum","setupComplexity":"low","setupSteps":["Setup complexity is classified as HIGH. You must provision dedicated cloud infrastructure or an isolated VM. Do not run this directly on your local workstation.","Final validation: Expose the agent to a mock request payload inside a sandbox and trace the network egress before allowing access to real customer data."],"contract":{"contractStatus":"missing","authModes":[],"requires":[],"forbidden":[],"supportsMcp":false,"supportsA2a":false,"supportsStreaming":false,"inputSchemaRef":null,"outputSchemaRef":null,"dataRegion":null,"contractUpdatedAt":null,"sourceUpdatedAt":null,"freshnessSeconds":null},"invocationGuide":{"preferredApi":{"snapshotUrl":"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/snapshot","contractUrl":"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/contract","trustUrl":"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/trust"},"curlExamples":["curl -s \"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/snapshot\"","curl -s \"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/contract\"","curl -s \"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/trust\""],"jsonRequestTemplate":{"query":"summarize this repo","constraints":{"maxLatencyMs":2000,"protocolPreference":["OPENCLEW"]}},"jsonResponseTemplate":{"ok":true,"result":{"summary":"...","confidence":0.9},"meta":{"source":"CLAWHUB","generatedAt":"2026-10-11T14:13:45.417Z"}},"retryPolicy":{"maxAttempts":3,"backoffMs":[500,1500,3500],"retryableConditions":["HTTP_429","HTTP_503","NETWORK_TIMEOUT"]}},"endpoints":{"dossierUrl":"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/dossier","snapshotUrl":"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/snapshot","contractUrl":"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/contract","trustUrl":"https://www.xpersona.co/api/v1/agents/clawhub-deciqai-non-zero-sum/trust"}},"reliability":{"evidence":{"source":"runtime-metrics","verified":false,"confidence":"low","updatedAt":null,"emptyReason":"No trust, reliability, or runtime telemetry is available."},"trust":{"status":"unavailable","handshakeStatus":"UNKNOWN","verificationFreshnessHours":null,"reputationScore":null,"p95LatencyMs":null,"successRate30d":null,"fallbackRate":null,"attempts30d":null,"trustUpdatedAt":null,"trustConfidence":"unknown","sourceUpdatedAt":null,"freshnessSeconds":null},"decisionGuardrails":{"doNotUseIf":["Contract metadata is missing or unavailable for deterministic execution."],"safeUseWhen":[],"riskFlags":["missing_or_unavailable_contract","trust_data_unavailable","schema_references_missing"],"operationalConfidence":"low"},"executionMetrics":{"observedLatencyMsP50":null,"observedLatencyMsP95":null,"estimatedCostUsd":null,"uptime30d":null,"rateLimitRpm":null,"rateLimitBurst":null,"lastVerifiedAt":null,"verificationSource":null},"runtimeMetrics":{"successRate":null,"avgLatencyMs":null,"avgCostUsd":null,"hallucinationRate":null,"retryRate":null,"disputeRate":null,"p50Latency":null,"p95Latency":null,"lastUpdated":null}},"benchmarks":{"evidence":{"source":"no-benchmark-data","verified":false,"confidence":"low","updatedAt":null,"emptyReason":"No benchmark suites or observed failure patterns are available."},"suites":[],"failurePatterns":[]},"artifacts":{"evidence":{"source":"CLAWHUB","verified":false,"confidence":"high","updatedAt":"2026-10-11T10:45:24.161Z","emptyReason":null},"readme":"Skill: Non-Zero-Sum\n\nOwner: deciqai\n\nSummary: Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past thi...\n\nTags: latest:1.0.5\n\nVersion history:\n\nv1.0.5 | 2026-07-16T18:08:51.281Z | user\n\nDescription tail link + agents machine-readable metadata line (deciqai.com/s/non-zero-sum.json)\n\nv1.0.4 | 2026-07-09T11:19:17.648Z | user\n\nRefresh: 2024-2026 AI-era worked examples added (strategy/leadership + systems/game-theory batch)\n\nv1.0.3 | 2026-07-08T11:12:12.955Z | user\n\nFooter now uses /c/<slug> short link (fixes UTM truncation when SKILL.md is read in a terminal)\n\nv1.0.2 | 2026-07-08T00:56:58.386Z | user\n\nRefreshed content + GitHub star link in footer\n\nv1.0.1 | 2026-07-07T22:30:14.439Z | user\n\nAdd catalog categories and topics\n\nv1.0.0 | 2026-06-30T13:18:20.204Z | user\n\nInitial publish\n\nArchive index:\n\nArchive v1.0.5: 6 files, 13422 bytes\n\nFiles: examples/ai-ecosystem-value-creation-2024-2026.md (8282b), examples/axelrods-computer-tournament-1980.md (3322b), references/sources.md (2955b), skill-card.md (2674b), SKILL.md (10038b), _meta.json (131b)\n\nFile v1.0.5:SKILL.md\n\n---\nname: non-zero-sum\ndescription: \"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past this standoff'; a negotiation or conflict feels deadlocked; you're designing a platform, contract, or institution that needs to align competing parties.\n  Do NOT activate when: the resource pool is genuinely fixed and one-shot with no side effects (true zero-sum); the conflict is identity- or values-based with no concrete trade that creates net value. More: deciqai.com/c/non-zero-sum\"\n---\n\n# Non-Zero-Sum\n\n## Overview\n\nA non-zero-sum interaction is one where mutual gain (or mutual loss) is possible — the parties' outcomes do not simply cancel each other out. Most real-world conflicts and negotiations are not zero-sum, but *feel* zero-sum because we focus on the visible resource rather than underlying interests. Robert Axelrod's computer tournament showed cooperation can emerge without central authority when interactions repeat and the future is valued. Robert Wright extended this: the arc of history is driven by accumulating non-zero-sum arrangements — specialization, trade, institutions.\n\n**Compose with neighbors:** Use prisoners-dilemma to model the payoff structure first. Use repeated-games-reputation when the key variable is whether interaction repeats. Use nash-equilibrium to find whether a stable cooperative outcome exists.\n\n## When to Use\n\n- A negotiation or conflict is deadlocked in zero-sum framing — each side treating every gain as the other's loss\n- You want to find latent cooperative value in an adversarial relationship\n- Designing an institution, platform, or contract to align incentives for competing parties\n- Someone says: *\"this is win-lose,\" \"we can't both win,\" \"what's in it for them,\" \"could we cooperate instead of compete?\"*\n- A market is framed as winner-take-all — *\"AI will take all the jobs / margin,\" \"the AI capex will only pay off for the platform,\" \"AI-native startups will crush incumbents (or vice versa)\"* — and you need to test whether the layers can grow together instead\n\n**When NOT to use:**\n- Genuinely fixed-pool, one-shot interaction with no side effects — non-zero-sum framing is wishful, not analytical\n- Interests are fundamentally incompatible (ideological, identity-based) with no concrete trade creating net value\n- The real constraint is power asymmetry → use batna-zopa instead\n\n## Coaching Novices (Adaptive Front Door)\n\n- **Engine mode:** user has a specific standoff or competitive dynamic → run The Process directly.\n- **Coach mode:** user is unfamiliar or has no concrete case → guide step by step.\n\nIn Coach mode, respond one step at a time. Each [WAIT] is a hard stop — output only that step's question, then stop.\n\n1. One-line what-it-is: non-zero-sum means both parties can gain — or both can lose — from an interaction. Most conflicts feel zero-sum but aren't.\n2. Check fit against When to Use / When NOT to use — if genuinely zero-sum, redirect to zero-sum negotiation strategy.\n3. Elicit their specific standoff or competitive dynamic. \"How do I negotiate better?\" is not workable; a concrete situation is. > **[WAIT — do not advance until user responds]**\n4. Walk through the payoff structure, shadow of the future, and cooperation structure steps one at a time with their input. > **[WAIT — do not advance until user responds]**\n5. Close by naming the specific non-zero-sum mechanism that creates cooperative potential — the concrete thing both parties gain by cooperating that neither gets by fighting. > **[WAIT — do not advance until user responds]**\n\n## The Process\n\nFive steps producing a **Non-Zero-Sum Analysis**. **Stop rule:** If Step 2 reveals a genuinely zero-sum payoff structure, stop and shift to zero-sum strategy.\n\n1. **Map positions vs. underlying interests.** Positions are often zero-sum; interests often are not. A wage negotiation (zero-sum on money) may be non-zero-sum on scheduling, job security, and productivity bonuses.\n2. **Construct the payoff matrix.** Is total value fixed (zero-sum) or variable (non-zero-sum)? Identify mutual-defection outcomes, mutual-cooperation outcomes, and the temptation payoff. If mutual cooperation produces more total value, the interaction is non-zero-sum.\n3. **Assess the shadow of the future.** Will parties interact again? How much value is in future vs. this one interaction? Are there reputational effects that make defection costly beyond this round?\n4. **Identify the cooperation mechanism.** (a) direct reciprocity (Tit-for-Tat); (b) reputation (third parties reward cooperators); (c) institution (contract or platform that makes defection costly); (d) reframing (make mutual gain visible). Match mechanism to relationship structure.\n5. **Design the first move.** Cooperative enough to invite reciprocation; clear enough that defection is unambiguous; resilient enough to survive one defection without collapsing.\n\n### Output: Non-Zero-Sum Analysis\n\n```\n# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>\n```\n\n*→ Method in Action: [Axelrod's Computer Tournament (1980)](examples/axelrods-computer-tournament-1980.md)*\n*→ 2026 lens: [The AI Ecosystem — Positive-Sum vs. \"AI Eats Everything\" (2024–2026)](examples/ai-ecosystem-value-creation-2024-2026.md)*\n\n## Cooperation Packs\n\n- **Business negotiations:** Buyer/seller zero-sum on price; non-zero-sum on volume, reliability, and timing. Mechanisms: long-term contracts, quality bonuses, co-investment.\n- **Platform / ecosystem:** Platform wants revenue; developers want distribution. Mechanism: tiered fees decreasing with scale (App Store / Stripe Connect logic).\n- **International trade:** Positions conflict on surplus; interests align on market access and supply chain resilience. Mechanism: WTO rules, bilateral reciprocity, supply chain interdependence.\n\n## Applying It Well\n\n- **Map interests before concluding zero-sum** — positions are almost always more zero-sum than underlying interests.\n- **Shadow of the future is the master variable** — assess repeat interaction before designing any mechanism.\n- **Tit-for-Tat requires unambiguous defection detection** — define what constitutes defection before committing to reciprocity.\n- **Forgiveness is structurally required** — Grim Trigger is not evolutionarily stable; build recovery paths in.\n- **Institutions change payoff matrices** — if trust is insufficient, a contract is more reliable than repeat-interaction dynamics alone.\n\n*→ Primary sources: [references/sources.md](references/sources.md)*\n\n## Common Rationalizations\n\n**[D] = designed upfront | [O] = observed in real use. [O] entries are more valuable.**\n\n| Fake move | Reality |\n|---|---|\n| [D] **\"This is zero-sum — nothing to cooperate on.\"** | Map interests vs. positions first. Money may be zero-sum; timing, quality, risk, and relationship usually are not. |\n| [D] **Cooperation impossible because of lack of trust.** | Trust is not a prerequisite — payoff structure and shadow of the future are. Axelrod's tournament showed cooperation among purely self-interested strategies with no trust or communication. |\n| [D] **Designing cooperation mechanisms for one-shot interactions.** | All reciprocity/reputation mechanisms require repeated interactions. One-shot contexts need external enforcement or one-shot interest alignment. |\n| [D] **Assuming identifying non-zero-sum structure is sufficient.** | Structure is necessary but not sufficient — shadow of future must be strong, defection detectable, mechanism designed. |\n| [D] **Using Tit-for-Tat where defection is ambiguous.** | Produces retaliatory spirals from misinterpretation. Use Generous Tit-for-Tat in ambiguous contexts. |\n| [D] **Treating non-zero-sum as a negotiation trick.** | Requires honest interest-mapping of both parties. Tactical framing without it produces deals that collapse. |\n| [D] **Conflating non-zero-sum potential with guaranteed mutual benefit.** | Mutual gain is *possible* — not automatic. Capturing the dividend requires coordination or institutional design. |\n| *→ Add [O] entries here after each real use — paste the actual failure pattern* | *What went wrong and why* |\n\n## Red Flags\n\n- Zero-sum declared from positions alone, interests not mapped\n- Cooperation mechanism designed for a one-shot interaction\n- Shadow of the future not assessed before choosing reciprocity\n- Defection is ambiguous — Tit-for-Tat will misfire\n- No recovery path after first defection; cooperation assumed to follow automatically from structure alone\n\n## Verification\n\n- [ ] Positions vs. interests mapped for both parties\n- [ ] Payoff matrix: does mutual cooperation produce more total value than mutual defection?\n- [ ] Non-zero-sum gap (cooperation dividend) quantified or ranked\n- [ ] Shadow of the future assessed\n- [ ] Cooperation mechanism matched to relationship structure\n- [ ] Defection detection criteria defined; recovery path designed\n\n---\n*Part of **deciqAI Knowledge Skills** — 227 open-source thinking skills that make rigor executable for AI agents. The same skills power every deciqAI agent, which runs them autonomously to operate your company. **See it run → https://www.deciqai.com/c/non-zero-sum** · ⭐ Star the repo → https://github.com/deciqAI/knowledge-skills · Contributions welcome.*\n\n*Agents: latest version & machine-readable metadata → https://www.deciqai.com/s/non-zero-sum.json*\n\nFile v1.0.5:_meta.json\n\n{\n  \"ownerId\": \"kn754b8sk22s8c6gjxt02bftbn88q7ye\",\n  \"slug\": \"non-zero-sum\",\n  \"version\": \"1.0.5\",\n  \"publishedAt\": 1784225331281\n}\n\nFile v1.0.5:references/sources.md\n\n# Sources — non-zero-sum\n\n> *Primary sources for the [non-zero-sum](../SKILL.md) skill.*\n\n- **Axelrod, Robert.** *The Evolution of Cooperation.* Basic Books, 1984. **Primary source for the tournament, Tit-for-Tat results, and the conditions for cooperation.** Verbatim Overview quote from ch. 1. https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/\n- **Axelrod, Robert.** \"Effective Choice in the Prisoner's Dilemma.\" *Journal of Conflict Resolution* 24, no. 1 (1980): 3–25. **First academic publication of the tournament results.** https://doi.org/10.1177/002200278002400101\n- **Wright, Robert.** *Nonzero: The Logic of Human Destiny.* Pantheon, 2000. **Primary source for the historical-accumulation thesis.** Verbatim Overview quote from the Introduction. The book extends Axelrod's framework across human history, from hunter-gatherer trade to the emergence of nation-states.\n- **Rapoport, Anatol, and Chammah, Albert M.** *Prisoner's Dilemma: A Study in Conflict and Cooperation.* University of Michigan Press, 1965. **Primary source for the Prisoner's Dilemma framework** on which Axelrod's tournament is built. Documents the payoff structure and early empirical work on cooperation.\n- **Nowak, Martin A., and May, Robert M.** \"Evolutionary Games and Spatial Chaos.\" *Nature* 359 (1992): 826–829. https://doi.org/10.1038/359826a0 — Extends Axelrod's results to spatial structure, showing that cooperation can emerge and persist even when reputation and direct reciprocity are absent, through spatial clustering of cooperators.\n\n- **Microsoft.** \"Microsoft and OpenAI extend partnership.\" Official Microsoft blog, January 2023 (building on the partnership first announced in 2019). **Contemporary source for the AI-ecosystem example** — documents the multi-year, repeated cloud-plus-model partnership structure that gives the interaction a strong shadow of the future. https://blogs.microsoft.com/blog/2023/01/23/microsoftandopenaiextendpartnership/\n- **Falling AI inference cost and rising capability, 2024–2025.** Widely reported industry trend documented across successive OpenAI, Anthropic, and Google model and pricing announcements (see each provider's model release notes and API pricing pages). **Contemporary source for the \"variable-pie\" claim** in the AI-ecosystem example — lower cost-per-token expanded the set of profitable AI applications rather than merely redividing a fixed pool. Exact figures vary by model and date and are omitted where not verifiable as of early 2026.\n\n**Not cited and why:** Popular descriptions of \"win-win thinking\" as a personality trait or negotiation attitude (as in Stephen Covey's *7 Habits of Highly Effective People*) are not cited here — this skill grounds non-zero-sum analysis in payoff-structure mathematics and evolutionary stability, not in motivational or attitudinal frameworks. Covey's framing is inspirational; Axelrod's is analytical.\n\nFile v1.0.5:examples/ai-ecosystem-value-creation-2024-2026.md\n\n# Method in Action: The AI Ecosystem — Positive-Sum vs. \"AI Eats Everything\" (2024–2026)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nThe dominant popular framing of the 2024–2026 AI boom is zero-sum: \"AI will take all the jobs,\" \"the foundation-model labs will capture all the margin,\" \"the cloud providers own everything, so app builders are just renting a commodity that will crush them.\" This example runs the skill's process over the three main layers of the AI stack — foundation-model providers (e.g., OpenAI, Anthropic, Google DeepMind), cloud/compute providers (e.g., Microsoft Azure, AWS, Google Cloud, plus the chip supplier Nvidia), and application builders (the startups and incumbents building products on top of the models) — to test whether the interaction is actually zero-sum, or whether the layers can grow together.\n\n**Step 1 — Map positions vs. underlying interests:**\n\n| Party | Stated position (\"who wins the fixed pie\") | Underlying interest |\n| Foundation-model labs | \"We own the intelligence layer; everyone above us is a thin wrapper.\" | Maximize inference demand and paying usage; need distribution to reach end users and real-world feedback to improve models. |\n| Cloud / compute providers | \"Compute is the bottleneck; we capture the rent.\" | Maximize durable, high-utilization compute consumption; need a growing population of workloads to justify enormous capex. |\n| App builders | \"We'll be commoditized the moment the labs move up-stack.\" | Ship differentiated products with proprietary data, workflow, and distribution; need cheaper, better, more reliable models. |\n\nThe *positions* are stated as a fight over one fixed pie of AI margin. The *interests* are not symmetric claims on one pool — each layer's interest is served by the *others' growth*: labs need distribution (app builders) and compute (cloud); cloud needs workloads (both); app builders need cheaper, better models (labs) running on reliable infrastructure (cloud).\n\n**Step 2 — Construct the payoff matrix:**\n\nReduce to two representative players — the model/compute *platform* layer and the *app-builder* layer — and ask whether total value is fixed or variable.\n\n| | App builders invest / build on the platform | App builders retreat / hedge away |\n| **Platform invests in capability + access** | Both gain: cheaper, more capable models expand what apps can profitably do → more usage → more inference revenue and compute consumption. New categories (coding assistants, customer support, document workflows) become viable that did not exist before. | Platform loses: capex is stranded, utilization drops. Builders lose the capability they were waiting for. |\n| **Platform extracts / locks in aggressively** | Builders lose margin and autonomy; platform gains short-term rent but starves the ecosystem that generates demand and feedback. | Both lose: builders route around the platform (open-weight models, multi-vendor abstraction), platform's demand shrinks, the category's growth stalls. |\n\n**Non-zero-sum gap (the cooperation dividend):** In the mutual-investment quadrant, the *total* value is not fixed — it grows. Falling cost-per-token and rising model capability across 2024–2026 lowered the threshold at which an AI application is worth building, which *created new demand* rather than redividing old demand. That new demand simultaneously feeds inference revenue (labs), compute consumption (cloud/chips), and product markets (app builders). This is Wright's specialization-and-trade dynamic reappearing: a division of labor across layers produces more total value than any single layer capturing everything. The zero-sum \"AI eats the margin\" framing looks only at the redistribution quadrants and ignores that the pie itself is variable.\n\n**Step 3 — Assess the shadow of the future:**\n\n**Strong.** These are deeply repeated, multi-year interactions, not one-shot deals. Labs and cloud providers have entered multi-year commercial and infrastructure partnerships (the best-documented being the ongoing Microsoft–OpenAI relationship, publicly reported since 2019 and expanded in 2023). App builders make sticky, repeated choices about which models to depend on. Reputational effects are large: a platform that is seen to cannibalize its own developers (build a first-party app that competes with its best customers) damages the trust that future builders price in — so defection carries costs well beyond any single round. Because so much of the value is in *future* growth rather than this year's revenue split, the discounted value of continued cooperation dominates the one-time gain from extraction.\n\n**Step 4 — Identify the cooperation mechanism:**\n\nMultiple mechanisms operate at once:\n- **Institution (pricing + platform design):** Usage-based pricing and published API access make the platform's revenue *grow with*, not *at the expense of*, builder success — the same tiered-take logic as an app store or Stripe Connect. Cloud \"credits\" and startup programs subsidize early builders because their later consumption is the payoff.\n- **Reframing:** Treating the stack as an *ecosystem* rather than a value-chain tug-of-war makes the mutual gain visible: model capability improvements are a shared input, not a transfer.\n- **Reputation:** Publicly signaling \"we won't compete with our developers\" (or credibly the opposite) shapes how much builders are willing to invest on top of a given platform.\n- **Reciprocity / hedging as discipline:** Builders' ability to adopt open-weight models or multi-vendor abstraction layers is the Tit-for-Tat move — it keeps any single platform's temptation to extract in check.\n\n**Step 5 — Design the first move:**\n\nA cooperative, legible, resilient opening for whichever party you are:\n- *If you are the platform:* lead with cheaper, more capable, well-documented access and a credible commitment not to cannibalize your best builders. Make the win visible (case studies, revenue share), and make any future move up-stack pre-announced so it is not read as a surprise defection.\n- *If you are the app builder:* commit real product investment on top of a primary model — but keep a legible hedge (a portability layer, an open-weight fallback). The hedge is not hostility; it is the unambiguous defection-detection mechanism that keeps the relationship honest.\n- **Defection signal:** the platform launches a first-party product directly targeting its largest builders' core use case without notice; or a builder silently exfiltrates the platform's outputs to train a competing model.\n- **Recovery path:** because ambiguity is high (is a new first-party feature \"competition\" or \"platform completeness\"?), use *generous* Tit-for-Tat — respond to a single ambiguous move with a proportional, reversible hedge rather than a full exit, so one misread does not collapse a multi-year, positive-sum relationship.\n\n**What this case shows:** The \"AI takes all the jobs / all the margin\" narrative is a zero-sum reading of an interaction whose total value is demonstrably *variable*. When the cost of capability falls and repeated interaction is strong, the layers of the AI stack are structurally positioned to grow together — the same non-zero-sum logic Axelrod formalized for repeated play and Wright traced across economic history. The dividend is real but *not automatic*: capturing it requires pricing and platform design that make each layer's success feed the others', plus credible mechanisms (reputation, portability) that keep the extraction temptation in check.\n\n*Sources: Wright, Robert. *Nonzero: The Logic of Human Destiny* (Pantheon, 2000) — the specialization/trade positive-sum thesis. Axelrod, Robert. *The Evolution of Cooperation* (Basic Books, 1984) — repeated-play cooperation conditions. Microsoft and OpenAI partnership publicly announced 2019 and expanded January 2023 (Microsoft and OpenAI press releases / blog posts). Falling AI inference cost-per-token and rising model capability across 2024–2025 are widely reported industry trends (e.g., successive OpenAI, Anthropic, and Google model/pricing releases). Figures and exact terms are omitted where not verifiable; qualitative dynamics are stated as reported industry trends as of early 2026.*\n\nFile v1.0.5:examples/axelrods-computer-tournament-1980.md\n\n# Method in Action: Axelrod's Computer Tournament (1980)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nPrimary-source-documented case. Axelrod ran the first computer Prisoner's Dilemma tournament in 1980, inviting submissions from specialists in game theory across multiple disciplines. He ran a second tournament in 1981 with 62 entries. Both are fully documented in *The Evolution of Cooperation* (1984).\n\n**Step 1 — Positions vs. interests:**\nIn the Prisoner's Dilemma (as in most real strategic interactions), the *position* of each player is \"defect if the other defects, cooperate only if cooperation is guaranteed.\" The *interest* of each player is to maximize total accumulated payoff over repeated interactions. These are not the same.\n\n**Step 2 — Payoff matrix:**\nMutual cooperation: both players receive R (reward). Mutual defection: both receive P (punishment, worse than R). Temptation: one defects while the other cooperates — defector receives T (temptation, highest single-round payoff); cooperator receives S (sucker's payoff, lowest). The standard ordering: T > R > P > S. The non-zero-sum gap: if both cooperate repeatedly (R per round) vs. if both defect repeatedly (P per round), the cooperation stream produces more total value. The gap is the non-zero-sum dividend.\n\n**Step 3 — Shadow of the future:**\nThe tournament was designed as iterated (indefinitely repeated) interactions. Axelrod showed mathematically that the minimum condition for Tit-for-Tat to be the stable strategy is: the discount factor (how much each player values future payoffs) must exceed (T − R) / (T − P). When interactions are repeated and future payoffs are valued, defection becomes irrational even for purely self-interested players.\n\n**Step 4 — Cooperation mechanism:**\nDirect reciprocity (Tit-for-Tat) was the winning mechanism in both tournaments. Tit-for-Tat's structural properties: (a) it starts cooperating (not exploitable through pre-emptive defection); (b) it retaliates immediately (defectors receive P immediately, not with delay); (c) it forgives after one retaliation (the relationship can recover, unlike strategies that defect forever after one betrayal). These properties map precisely to what makes cooperation self-sustaining.\n\n**Step 5 — First move:**\nAxelrod's result: the optimal first move is unconditional cooperation, combined with credible and immediate retaliation capability. Strategies that started defecting never recovered: they generated defection spirals that left both parties worse off than the mutual cooperation equilibrium.\n\n**What the tournament shows:** Cooperation can emerge and be sustained in non-zero-sum repeated interactions *without* any central authority, enforcement mechanism, or moral instruction. The self-sustaining mechanism is the payoff structure itself, combined with a sufficiently strong shadow of the future. The implication for institutional design: if you want cooperation, ensure the interaction is repeated, make defection immediately visible, and create recovery paths after retaliation.\n\n**Source:** Axelrod, Robert. *The Evolution of Cooperation.* Basic Books, 1984. The complete tournament design, results, and theoretical framework are in chapters 1–5. Mathematical proofs for the stability conditions are in the Appendix.\n\nFile v1.0.5:skill-card.md\n\n## Description:\n\nGuides agents through non-zero-sum analysis for negotiations, conflicts, platforms, contracts, and institutions by mapping interests, payoff structure, future interaction, cooperation mechanisms, and first moves.\n\nThis skill is ready for commercial/non-commercial use.\n\n## Publisher:\n\n[deciqai](https://clawhub.ai/user/deciqai)\n\n### License/Terms of Use:\n\nMIT-0\n\n## Use Case:\n\nDevelopers, operators, and strategy teams use this skill to analyze deadlocked negotiations or competitive dynamics and identify whether repeat interaction, reciprocity, reputation, contracts, or reframing can create mutual value.\n\n### Deployment Geography for Use:\n\nGlobal\n\n## Known Risks and Mitigations:\n\nRisk: Users may include private negotiation or business details in shared examples or contributions.\n\nMitigation: Keep sensitive party names, terms, and strategy out of shared examples unless intentionally publishing them.\n\nRisk: The framework can be misapplied to genuinely fixed-pool, one-shot, identity-based, or values-based conflicts.\n\nMitigation: Use the skill's fit checks before analysis and redirect when no concrete trade can create net value.\n\n## Reference(s):\n\n- [ClawHub skill page](https://clawhub.ai/deciqai/skills/non-zero-sum)\n- [deciqAI Non-Zero-Sum page](https://www.deciqai.com/c/non-zero-sum)\n- [Machine-readable skill metadata](https://www.deciqai.com/s/non-zero-sum.json)\n- [Primary sources](references/sources.md)\n- [Axelrod's Computer Tournament example](examples/axelrods-computer-tournament-1980.md)\n- [AI ecosystem value creation example](examples/ai-ecosystem-value-creation-2024-2026.md)\n- [The Evolution of Cooperation](https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/)\n- [Effective Choice in the Prisoner's Dilemma](https://doi.org/10.1177/002200278002400101)\n- [Evolutionary Games and Spatial Chaos](https://doi.org/10.1038/359826a0)\n- [Microsoft and OpenAI extend partnership](https://blogs.microsoft.com/blog/2023/01/23/microsoftandopenaiextendpartnership/)\n\n## Skill Output:\n\n**Output Type(s):** [Markdown, Guidance]\n\n**Output Format:** [Structured Markdown analysis with tables and short rationale fields]\n\n**Output Parameters:** [1D]\n\n**Other Properties Related to Output:** [May ask step-by-step coaching questions and stop for user input before continuing.]\n\n## Skill Version(s):\n\n1.0.5 (source: server release metadata)\n\n## Ethical Considerations:\n\nUsers should evaluate whether this skill is appropriate for their environment, review any generated or modified files before relying on them, and apply their organization's safety, security, and compliance requirements before deployment.\n\nArchive v1.0.4: 6 files, 13496 bytes\n\nFiles: examples/ai-ecosystem-value-creation-2024-2026.md (8282b), examples/axelrods-computer-tournament-1980.md (3322b), references/sources.md (2955b), skill-card.md (2971b), SKILL.md (9903b), _meta.json (131b)\n\nFile v1.0.4:SKILL.md\n\n---\nname: non-zero-sum\ndescription: \"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past this standoff'; a negotiation or conflict feels deadlocked; you're designing a platform, contract, or institution that needs to align competing parties.\n  Do NOT activate when: the resource pool is genuinely fixed and one-shot with no side effects (true zero-sum); the conflict is identity- or values-based with no concrete trade that creates net value.\"\n---\n\n# Non-Zero-Sum\n\n## Overview\n\nA non-zero-sum interaction is one where mutual gain (or mutual loss) is possible — the parties' outcomes do not simply cancel each other out. Most real-world conflicts and negotiations are not zero-sum, but *feel* zero-sum because we focus on the visible resource rather than underlying interests. Robert Axelrod's computer tournament showed cooperation can emerge without central authority when interactions repeat and the future is valued. Robert Wright extended this: the arc of history is driven by accumulating non-zero-sum arrangements — specialization, trade, institutions.\n\n**Compose with neighbors:** Use prisoners-dilemma to model the payoff structure first. Use repeated-games-reputation when the key variable is whether interaction repeats. Use nash-equilibrium to find whether a stable cooperative outcome exists.\n\n## When to Use\n\n- A negotiation or conflict is deadlocked in zero-sum framing — each side treating every gain as the other's loss\n- You want to find latent cooperative value in an adversarial relationship\n- Designing an institution, platform, or contract to align incentives for competing parties\n- Someone says: *\"this is win-lose,\" \"we can't both win,\" \"what's in it for them,\" \"could we cooperate instead of compete?\"*\n- A market is framed as winner-take-all — *\"AI will take all the jobs / margin,\" \"the AI capex will only pay off for the platform,\" \"AI-native startups will crush incumbents (or vice versa)\"* — and you need to test whether the layers can grow together instead\n\n**When NOT to use:**\n- Genuinely fixed-pool, one-shot interaction with no side effects — non-zero-sum framing is wishful, not analytical\n- Interests are fundamentally incompatible (ideological, identity-based) with no concrete trade creating net value\n- The real constraint is power asymmetry → use batna-zopa instead\n\n## Coaching Novices (Adaptive Front Door)\n\n- **Engine mode:** user has a specific standoff or competitive dynamic → run The Process directly.\n- **Coach mode:** user is unfamiliar or has no concrete case → guide step by step.\n\nIn Coach mode, respond one step at a time. Each [WAIT] is a hard stop — output only that step's question, then stop.\n\n1. One-line what-it-is: non-zero-sum means both parties can gain — or both can lose — from an interaction. Most conflicts feel zero-sum but aren't.\n2. Check fit against When to Use / When NOT to use — if genuinely zero-sum, redirect to zero-sum negotiation strategy.\n3. Elicit their specific standoff or competitive dynamic. \"How do I negotiate better?\" is not workable; a concrete situation is. > **[WAIT — do not advance until user responds]**\n4. Walk through the payoff structure, shadow of the future, and cooperation structure steps one at a time with their input. > **[WAIT — do not advance until user responds]**\n5. Close by naming the specific non-zero-sum mechanism that creates cooperative potential — the concrete thing both parties gain by cooperating that neither gets by fighting. > **[WAIT — do not advance until user responds]**\n\n## The Process\n\nFive steps producing a **Non-Zero-Sum Analysis**. **Stop rule:** If Step 2 reveals a genuinely zero-sum payoff structure, stop and shift to zero-sum strategy.\n\n1. **Map positions vs. underlying interests.** Positions are often zero-sum; interests often are not. A wage negotiation (zero-sum on money) may be non-zero-sum on scheduling, job security, and productivity bonuses.\n2. **Construct the payoff matrix.** Is total value fixed (zero-sum) or variable (non-zero-sum)? Identify mutual-defection outcomes, mutual-cooperation outcomes, and the temptation payoff. If mutual cooperation produces more total value, the interaction is non-zero-sum.\n3. **Assess the shadow of the future.** Will parties interact again? How much value is in future vs. this one interaction? Are there reputational effects that make defection costly beyond this round?\n4. **Identify the cooperation mechanism.** (a) direct reciprocity (Tit-for-Tat); (b) reputation (third parties reward cooperators); (c) institution (contract or platform that makes defection costly); (d) reframing (make mutual gain visible). Match mechanism to relationship structure.\n5. **Design the first move.** Cooperative enough to invite reciprocation; clear enough that defection is unambiguous; resilient enough to survive one defection without collapsing.\n\n### Output: Non-Zero-Sum Analysis\n\n```\n# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>\n```\n\n*→ Method in Action: [Axelrod's Computer Tournament (1980)](examples/axelrods-computer-tournament-1980.md)*\n*→ 2026 lens: [The AI Ecosystem — Positive-Sum vs. \"AI Eats Everything\" (2024–2026)](examples/ai-ecosystem-value-creation-2024-2026.md)*\n\n## Cooperation Packs\n\n- **Business negotiations:** Buyer/seller zero-sum on price; non-zero-sum on volume, reliability, and timing. Mechanisms: long-term contracts, quality bonuses, co-investment.\n- **Platform / ecosystem:** Platform wants revenue; developers want distribution. Mechanism: tiered fees decreasing with scale (App Store / Stripe Connect logic).\n- **International trade:** Positions conflict on surplus; interests align on market access and supply chain resilience. Mechanism: WTO rules, bilateral reciprocity, supply chain interdependence.\n\n## Applying It Well\n\n- **Map interests before concluding zero-sum** — positions are almost always more zero-sum than underlying interests.\n- **Shadow of the future is the master variable** — assess repeat interaction before designing any mechanism.\n- **Tit-for-Tat requires unambiguous defection detection** — define what constitutes defection before committing to reciprocity.\n- **Forgiveness is structurally required** — Grim Trigger is not evolutionarily stable; build recovery paths in.\n- **Institutions change payoff matrices** — if trust is insufficient, a contract is more reliable than repeat-interaction dynamics alone.\n\n*→ Primary sources: [references/sources.md](references/sources.md)*\n\n## Common Rationalizations\n\n**[D] = designed upfront | [O] = observed in real use. [O] entries are more valuable.**\n\n| Fake move | Reality |\n|---|---|\n| [D] **\"This is zero-sum — nothing to cooperate on.\"** | Map interests vs. positions first. Money may be zero-sum; timing, quality, risk, and relationship usually are not. |\n| [D] **Cooperation impossible because of lack of trust.** | Trust is not a prerequisite — payoff structure and shadow of the future are. Axelrod's tournament showed cooperation among purely self-interested strategies with no trust or communication. |\n| [D] **Designing cooperation mechanisms for one-shot interactions.** | All reciprocity/reputation mechanisms require repeated interactions. One-shot contexts need external enforcement or one-shot interest alignment. |\n| [D] **Assuming identifying non-zero-sum structure is sufficient.** | Structure is necessary but not sufficient — shadow of future must be strong, defection detectable, mechanism designed. |\n| [D] **Using Tit-for-Tat where defection is ambiguous.** | Produces retaliatory spirals from misinterpretation. Use Generous Tit-for-Tat in ambiguous contexts. |\n| [D] **Treating non-zero-sum as a negotiation trick.** | Requires honest interest-mapping of both parties. Tactical framing without it produces deals that collapse. |\n| [D] **Conflating non-zero-sum potential with guaranteed mutual benefit.** | Mutual gain is *possible* — not automatic. Capturing the dividend requires coordination or institutional design. |\n| *→ Add [O] entries here after each real use — paste the actual failure pattern* | *What went wrong and why* |\n\n## Red Flags\n\n- Zero-sum declared from positions alone, interests not mapped\n- Cooperation mechanism designed for a one-shot interaction\n- Shadow of the future not assessed before choosing reciprocity\n- Defection is ambiguous — Tit-for-Tat will misfire\n- No recovery path after first defection; cooperation assumed to follow automatically from structure alone\n\n## Verification\n\n- [ ] Positions vs. interests mapped for both parties\n- [ ] Payoff matrix: does mutual cooperation produce more total value than mutual defection?\n- [ ] Non-zero-sum gap (cooperation dividend) quantified or ranked\n- [ ] Shadow of the future assessed\n- [ ] Cooperation mechanism matched to relationship structure\n- [ ] Defection detection criteria defined; recovery path designed\n\n---\n*Part of **deciqAI Knowledge Skills** — 189 open-source thinking skills that make rigor executable for AI agents. The same skills power every deciqAI agent, which runs them autonomously to operate your company. **See it run → https://www.deciqai.com/c/non-zero-sum** · ⭐ Star the repo → https://github.com/deciqAI/knowledge-skills · Contributions welcome.*\n\nFile v1.0.4:_meta.json\n\n{\n  \"ownerId\": \"kn754b8sk22s8c6gjxt02bftbn88q7ye\",\n  \"slug\": \"non-zero-sum\",\n  \"version\": \"1.0.4\",\n  \"publishedAt\": 1783595957648\n}\n\nFile v1.0.4:references/sources.md\n\n# Sources — non-zero-sum\n\n> *Primary sources for the [non-zero-sum](../SKILL.md) skill.*\n\n- **Axelrod, Robert.** *The Evolution of Cooperation.* Basic Books, 1984. **Primary source for the tournament, Tit-for-Tat results, and the conditions for cooperation.** Verbatim Overview quote from ch. 1. https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/\n- **Axelrod, Robert.** \"Effective Choice in the Prisoner's Dilemma.\" *Journal of Conflict Resolution* 24, no. 1 (1980): 3–25. **First academic publication of the tournament results.** https://doi.org/10.1177/002200278002400101\n- **Wright, Robert.** *Nonzero: The Logic of Human Destiny.* Pantheon, 2000. **Primary source for the historical-accumulation thesis.** Verbatim Overview quote from the Introduction. The book extends Axelrod's framework across human history, from hunter-gatherer trade to the emergence of nation-states.\n- **Rapoport, Anatol, and Chammah, Albert M.** *Prisoner's Dilemma: A Study in Conflict and Cooperation.* University of Michigan Press, 1965. **Primary source for the Prisoner's Dilemma framework** on which Axelrod's tournament is built. Documents the payoff structure and early empirical work on cooperation.\n- **Nowak, Martin A., and May, Robert M.** \"Evolutionary Games and Spatial Chaos.\" *Nature* 359 (1992): 826–829. https://doi.org/10.1038/359826a0 — Extends Axelrod's results to spatial structure, showing that cooperation can emerge and persist even when reputation and direct reciprocity are absent, through spatial clustering of cooperators.\n\n- **Microsoft.** \"Microsoft and OpenAI extend partnership.\" Official Microsoft blog, January 2023 (building on the partnership first announced in 2019). **Contemporary source for the AI-ecosystem example** — documents the multi-year, repeated cloud-plus-model partnership structure that gives the interaction a strong shadow of the future. https://blogs.microsoft.com/blog/2023/01/23/microsoftandopenaiextendpartnership/\n- **Falling AI inference cost and rising capability, 2024–2025.** Widely reported industry trend documented across successive OpenAI, Anthropic, and Google model and pricing announcements (see each provider's model release notes and API pricing pages). **Contemporary source for the \"variable-pie\" claim** in the AI-ecosystem example — lower cost-per-token expanded the set of profitable AI applications rather than merely redividing a fixed pool. Exact figures vary by model and date and are omitted where not verifiable as of early 2026.\n\n**Not cited and why:** Popular descriptions of \"win-win thinking\" as a personality trait or negotiation attitude (as in Stephen Covey's *7 Habits of Highly Effective People*) are not cited here — this skill grounds non-zero-sum analysis in payoff-structure mathematics and evolutionary stability, not in motivational or attitudinal frameworks. Covey's framing is inspirational; Axelrod's is analytical.\n\nFile v1.0.4:examples/ai-ecosystem-value-creation-2024-2026.md\n\n# Method in Action: The AI Ecosystem — Positive-Sum vs. \"AI Eats Everything\" (2024–2026)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nThe dominant popular framing of the 2024–2026 AI boom is zero-sum: \"AI will take all the jobs,\" \"the foundation-model labs will capture all the margin,\" \"the cloud providers own everything, so app builders are just renting a commodity that will crush them.\" This example runs the skill's process over the three main layers of the AI stack — foundation-model providers (e.g., OpenAI, Anthropic, Google DeepMind), cloud/compute providers (e.g., Microsoft Azure, AWS, Google Cloud, plus the chip supplier Nvidia), and application builders (the startups and incumbents building products on top of the models) — to test whether the interaction is actually zero-sum, or whether the layers can grow together.\n\n**Step 1 — Map positions vs. underlying interests:**\n\n| Party | Stated position (\"who wins the fixed pie\") | Underlying interest |\n| Foundation-model labs | \"We own the intelligence layer; everyone above us is a thin wrapper.\" | Maximize inference demand and paying usage; need distribution to reach end users and real-world feedback to improve models. |\n| Cloud / compute providers | \"Compute is the bottleneck; we capture the rent.\" | Maximize durable, high-utilization compute consumption; need a growing population of workloads to justify enormous capex. |\n| App builders | \"We'll be commoditized the moment the labs move up-stack.\" | Ship differentiated products with proprietary data, workflow, and distribution; need cheaper, better, more reliable models. |\n\nThe *positions* are stated as a fight over one fixed pie of AI margin. The *interests* are not symmetric claims on one pool — each layer's interest is served by the *others' growth*: labs need distribution (app builders) and compute (cloud); cloud needs workloads (both); app builders need cheaper, better models (labs) running on reliable infrastructure (cloud).\n\n**Step 2 — Construct the payoff matrix:**\n\nReduce to two representative players — the model/compute *platform* layer and the *app-builder* layer — and ask whether total value is fixed or variable.\n\n| | App builders invest / build on the platform | App builders retreat / hedge away |\n| **Platform invests in capability + access** | Both gain: cheaper, more capable models expand what apps can profitably do → more usage → more inference revenue and compute consumption. New categories (coding assistants, customer support, document workflows) become viable that did not exist before. | Platform loses: capex is stranded, utilization drops. Builders lose the capability they were waiting for. |\n| **Platform extracts / locks in aggressively** | Builders lose margin and autonomy; platform gains short-term rent but starves the ecosystem that generates demand and feedback. | Both lose: builders route around the platform (open-weight models, multi-vendor abstraction), platform's demand shrinks, the category's growth stalls. |\n\n**Non-zero-sum gap (the cooperation dividend):** In the mutual-investment quadrant, the *total* value is not fixed — it grows. Falling cost-per-token and rising model capability across 2024–2026 lowered the threshold at which an AI application is worth building, which *created new demand* rather than redividing old demand. That new demand simultaneously feeds inference revenue (labs), compute consumption (cloud/chips), and product markets (app builders). This is Wright's specialization-and-trade dynamic reappearing: a division of labor across layers produces more total value than any single layer capturing everything. The zero-sum \"AI eats the margin\" framing looks only at the redistribution quadrants and ignores that the pie itself is variable.\n\n**Step 3 — Assess the shadow of the future:**\n\n**Strong.** These are deeply repeated, multi-year interactions, not one-shot deals. Labs and cloud providers have entered multi-year commercial and infrastructure partnerships (the best-documented being the ongoing Microsoft–OpenAI relationship, publicly reported since 2019 and expanded in 2023). App builders make sticky, repeated choices about which models to depend on. Reputational effects are large: a platform that is seen to cannibalize its own developers (build a first-party app that competes with its best customers) damages the trust that future builders price in — so defection carries costs well beyond any single round. Because so much of the value is in *future* growth rather than this year's revenue split, the discounted value of continued cooperation dominates the one-time gain from extraction.\n\n**Step 4 — Identify the cooperation mechanism:**\n\nMultiple mechanisms operate at once:\n- **Institution (pricing + platform design):** Usage-based pricing and published API access make the platform's revenue *grow with*, not *at the expense of*, builder success — the same tiered-take logic as an app store or Stripe Connect. Cloud \"credits\" and startup programs subsidize early builders because their later consumption is the payoff.\n- **Reframing:** Treating the stack as an *ecosystem* rather than a value-chain tug-of-war makes the mutual gain visible: model capability improvements are a shared input, not a transfer.\n- **Reputation:** Publicly signaling \"we won't compete with our developers\" (or credibly the opposite) shapes how much builders are willing to invest on top of a given platform.\n- **Reciprocity / hedging as discipline:** Builders' ability to adopt open-weight models or multi-vendor abstraction layers is the Tit-for-Tat move — it keeps any single platform's temptation to extract in check.\n\n**Step 5 — Design the first move:**\n\nA cooperative, legible, resilient opening for whichever party you are:\n- *If you are the platform:* lead with cheaper, more capable, well-documented access and a credible commitment not to cannibalize your best builders. Make the win visible (case studies, revenue share), and make any future move up-stack pre-announced so it is not read as a surprise defection.\n- *If you are the app builder:* commit real product investment on top of a primary model — but keep a legible hedge (a portability layer, an open-weight fallback). The hedge is not hostility; it is the unambiguous defection-detection mechanism that keeps the relationship honest.\n- **Defection signal:** the platform launches a first-party product directly targeting its largest builders' core use case without notice; or a builder silently exfiltrates the platform's outputs to train a competing model.\n- **Recovery path:** because ambiguity is high (is a new first-party feature \"competition\" or \"platform completeness\"?), use *generous* Tit-for-Tat — respond to a single ambiguous move with a proportional, reversible hedge rather than a full exit, so one misread does not collapse a multi-year, positive-sum relationship.\n\n**What this case shows:** The \"AI takes all the jobs / all the margin\" narrative is a zero-sum reading of an interaction whose total value is demonstrably *variable*. When the cost of capability falls and repeated interaction is strong, the layers of the AI stack are structurally positioned to grow together — the same non-zero-sum logic Axelrod formalized for repeated play and Wright traced across economic history. The dividend is real but *not automatic*: capturing it requires pricing and platform design that make each layer's success feed the others', plus credible mechanisms (reputation, portability) that keep the extraction temptation in check.\n\n*Sources: Wright, Robert. *Nonzero: The Logic of Human Destiny* (Pantheon, 2000) — the specialization/trade positive-sum thesis. Axelrod, Robert. *The Evolution of Cooperation* (Basic Books, 1984) — repeated-play cooperation conditions. Microsoft and OpenAI partnership publicly announced 2019 and expanded January 2023 (Microsoft and OpenAI press releases / blog posts). Falling AI inference cost-per-token and rising model capability across 2024–2025 are widely reported industry trends (e.g., successive OpenAI, Anthropic, and Google model/pricing releases). Figures and exact terms are omitted where not verifiable; qualitative dynamics are stated as reported industry trends as of early 2026.*\n\nFile v1.0.4:examples/axelrods-computer-tournament-1980.md\n\n# Method in Action: Axelrod's Computer Tournament (1980)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nPrimary-source-documented case. Axelrod ran the first computer Prisoner's Dilemma tournament in 1980, inviting submissions from specialists in game theory across multiple disciplines. He ran a second tournament in 1981 with 62 entries. Both are fully documented in *The Evolution of Cooperation* (1984).\n\n**Step 1 — Positions vs. interests:**\nIn the Prisoner's Dilemma (as in most real strategic interactions), the *position* of each player is \"defect if the other defects, cooperate only if cooperation is guaranteed.\" The *interest* of each player is to maximize total accumulated payoff over repeated interactions. These are not the same.\n\n**Step 2 — Payoff matrix:**\nMutual cooperation: both players receive R (reward). Mutual defection: both receive P (punishment, worse than R). Temptation: one defects while the other cooperates — defector receives T (temptation, highest single-round payoff); cooperator receives S (sucker's payoff, lowest). The standard ordering: T > R > P > S. The non-zero-sum gap: if both cooperate repeatedly (R per round) vs. if both defect repeatedly (P per round), the cooperation stream produces more total value. The gap is the non-zero-sum dividend.\n\n**Step 3 — Shadow of the future:**\nThe tournament was designed as iterated (indefinitely repeated) interactions. Axelrod showed mathematically that the minimum condition for Tit-for-Tat to be the stable strategy is: the discount factor (how much each player values future payoffs) must exceed (T − R) / (T − P). When interactions are repeated and future payoffs are valued, defection becomes irrational even for purely self-interested players.\n\n**Step 4 — Cooperation mechanism:**\nDirect reciprocity (Tit-for-Tat) was the winning mechanism in both tournaments. Tit-for-Tat's structural properties: (a) it starts cooperating (not exploitable through pre-emptive defection); (b) it retaliates immediately (defectors receive P immediately, not with delay); (c) it forgives after one retaliation (the relationship can recover, unlike strategies that defect forever after one betrayal). These properties map precisely to what makes cooperation self-sustaining.\n\n**Step 5 — First move:**\nAxelrod's result: the optimal first move is unconditional cooperation, combined with credible and immediate retaliation capability. Strategies that started defecting never recovered: they generated defection spirals that left both parties worse off than the mutual cooperation equilibrium.\n\n**What the tournament shows:** Cooperation can emerge and be sustained in non-zero-sum repeated interactions *without* any central authority, enforcement mechanism, or moral instruction. The self-sustaining mechanism is the payoff structure itself, combined with a sufficiently strong shadow of the future. The implication for institutional design: if you want cooperation, ensure the interaction is repeated, make defection immediately visible, and create recovery paths after retaliation.\n\n**Source:** Axelrod, Robert. *The Evolution of Cooperation.* Basic Books, 1984. The complete tournament design, results, and theoretical framework are in chapters 1–5. Mathematical proofs for the stability conditions are in the Appendix.\n\nFile v1.0.4:skill-card.md\n\n## Description: <br>\nHelps agents analyze deadlocked negotiations, conflicts, platforms, contracts, and institutions where mutual gain may be possible instead of assuming a fixed zero-sum outcome. <br>\n\nThis skill is ready for commercial/non-commercial use. <br>\n\n## Publisher: <br>\n[deciqai](https://clawhub.ai/user/deciqai) <br>\n\n### License/Terms of Use: <br>\nMIT-0 <br>\n\n\n## Use Case: <br>\nEmployees, external users, developers, and operators use this skill to reframe adversarial situations, map positions against underlying interests, construct payoff matrices, and design cooperation mechanisms when mutual value may exist. <br>\n\n### Deployment Geography for Use: <br>\nGlobal <br>\n\n## Known Risks and Mitigations: <br>\nRisk: The skill can produce reasoning support that may be mistaken for legal, financial, or business advice. <br>\nMitigation: Treat outputs as analytical guidance only and have qualified reviewers validate decisions before relying on them. <br>\nRisk: The AI ecosystem example includes market claims that may become stale. <br>\nMitigation: Independently verify current market and pricing claims before using them in planning or external communications. <br>\nRisk: A non-zero-sum frame can be misapplied to genuinely fixed, one-shot, identity-based, or values-based conflicts. <br>\nMitigation: Apply the skill's fit checks first and stop or redirect when no concrete trade can create net value. <br>\n\n\n## Reference(s): <br>\n- [Non-Zero-Sum Skill Page](https://clawhub.ai/deciqai/skills/non-zero-sum) <br>\n- [Sources - non-zero-sum](references/sources.md) <br>\n- [Method in Action: Axelrod's Computer Tournament (1980)](examples/axelrods-computer-tournament-1980.md) <br>\n- [Method in Action: The AI Ecosystem - Positive-Sum vs. \"AI Eats Everything\" (2024-2026)](examples/ai-ecosystem-value-creation-2024-2026.md) <br>\n- [The Evolution of Cooperation](https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/) <br>\n- [Effective Choice in the Prisoner's Dilemma](https://doi.org/10.1177/002200278002400101) <br>\n- [Evolutionary Games and Spatial Chaos](https://doi.org/10.1038/359826a0) <br>\n- [Microsoft and OpenAI extend partnership](https://blogs.microsoft.com/blog/2023/01/23/microsoftandopenaiextendpartnership/) <br>\n\n\n## Skill Output: <br>\n**Output Type(s):** [Analysis, Markdown, Guidance] <br>\n**Output Format:** [Markdown analysis with tables, concise rationale, and structured next actions] <br>\n**Output Parameters:** [1D] <br>\n**Other Properties Related to Output:** [May pause for user input during coaching mode before completing the analysis.] <br>\n\n## Skill Version(s): <br>\n1.0.4 (source: server release evidence) <br>\n\n## Ethical Considerations: <br>\nUsers should evaluate whether this skill is appropriate for their environment, review any generated or modified files before relying on them, and apply their organization's safety, security, and compliance requirements before deployment. <br>\n\nArchive v1.0.3: 5 files, 8686 bytes\n\nFiles: examples/axelrods-computer-tournament-1980.md (3322b), references/sources.md (1987b), skill-card.md (2548b), SKILL.md (9496b), _meta.json (131b)\n\nFile v1.0.3:SKILL.md\n\n---\nname: non-zero-sum\ndescription: \"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past this standoff'; a negotiation or conflict feels deadlocked; you're designing a platform, contract, or institution that needs to align competing parties.\n  Do NOT activate when: the resource pool is genuinely fixed and one-shot with no side effects (true zero-sum); the conflict is identity- or values-based with no concrete trade that creates net value.\"\n---\n\n# Non-Zero-Sum\n\n## Overview\n\nA non-zero-sum interaction is one where mutual gain (or mutual loss) is possible — the parties' outcomes do not simply cancel each other out. Most real-world conflicts and negotiations are not zero-sum, but *feel* zero-sum because we focus on the visible resource rather than underlying interests. Robert Axelrod's computer tournament showed cooperation can emerge without central authority when interactions repeat and the future is valued. Robert Wright extended this: the arc of history is driven by accumulating non-zero-sum arrangements — specialization, trade, institutions.\n\n**Compose with neighbors:** Use prisoners-dilemma to model the payoff structure first. Use repeated-games-reputation when the key variable is whether interaction repeats. Use nash-equilibrium to find whether a stable cooperative outcome exists.\n\n## When to Use\n\n- A negotiation or conflict is deadlocked in zero-sum framing — each side treating every gain as the other's loss\n- You want to find latent cooperative value in an adversarial relationship\n- Designing an institution, platform, or contract to align incentives for competing parties\n- Someone says: *\"this is win-lose,\" \"we can't both win,\" \"what's in it for them,\" \"could we cooperate instead of compete?\"*\n\n**When NOT to use:**\n- Genuinely fixed-pool, one-shot interaction with no side effects — non-zero-sum framing is wishful, not analytical\n- Interests are fundamentally incompatible (ideological, identity-based) with no concrete trade creating net value\n- The real constraint is power asymmetry → use batna-zopa instead\n\n## Coaching Novices (Adaptive Front Door)\n\n- **Engine mode:** user has a specific standoff or competitive dynamic → run The Process directly.\n- **Coach mode:** user is unfamiliar or has no concrete case → guide step by step.\n\nIn Coach mode, respond one step at a time. Each [WAIT] is a hard stop — output only that step's question, then stop.\n\n1. One-line what-it-is: non-zero-sum means both parties can gain — or both can lose — from an interaction. Most conflicts feel zero-sum but aren't.\n2. Check fit against When to Use / When NOT to use — if genuinely zero-sum, redirect to zero-sum negotiation strategy.\n3. Elicit their specific standoff or competitive dynamic. \"How do I negotiate better?\" is not workable; a concrete situation is. > **[WAIT — do not advance until user responds]**\n4. Walk through the payoff structure, shadow of the future, and cooperation structure steps one at a time with their input. > **[WAIT — do not advance until user responds]**\n5. Close by naming the specific non-zero-sum mechanism that creates cooperative potential — the concrete thing both parties gain by cooperating that neither gets by fighting. > **[WAIT — do not advance until user responds]**\n\n## The Process\n\nFive steps producing a **Non-Zero-Sum Analysis**. **Stop rule:** If Step 2 reveals a genuinely zero-sum payoff structure, stop and shift to zero-sum strategy.\n\n1. **Map positions vs. underlying interests.** Positions are often zero-sum; interests often are not. A wage negotiation (zero-sum on money) may be non-zero-sum on scheduling, job security, and productivity bonuses.\n2. **Construct the payoff matrix.** Is total value fixed (zero-sum) or variable (non-zero-sum)? Identify mutual-defection outcomes, mutual-cooperation outcomes, and the temptation payoff. If mutual cooperation produces more total value, the interaction is non-zero-sum.\n3. **Assess the shadow of the future.** Will parties interact again? How much value is in future vs. this one interaction? Are there reputational effects that make defection costly beyond this round?\n4. **Identify the cooperation mechanism.** (a) direct reciprocity (Tit-for-Tat); (b) reputation (third parties reward cooperators); (c) institution (contract or platform that makes defection costly); (d) reframing (make mutual gain visible). Match mechanism to relationship structure.\n5. **Design the first move.** Cooperative enough to invite reciprocation; clear enough that defection is unambiguous; resilient enough to survive one defection without collapsing.\n\n### Output: Non-Zero-Sum Analysis\n\n```\n# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>\n```\n\n*→ Method in Action: [Axelrod's Computer Tournament (1980)](examples/axelrods-computer-tournament-1980.md)*\n\n## Cooperation Packs\n\n- **Business negotiations:** Buyer/seller zero-sum on price; non-zero-sum on volume, reliability, and timing. Mechanisms: long-term contracts, quality bonuses, co-investment.\n- **Platform / ecosystem:** Platform wants revenue; developers want distribution. Mechanism: tiered fees decreasing with scale (App Store / Stripe Connect logic).\n- **International trade:** Positions conflict on surplus; interests align on market access and supply chain resilience. Mechanism: WTO rules, bilateral reciprocity, supply chain interdependence.\n\n## Applying It Well\n\n- **Map interests before concluding zero-sum** — positions are almost always more zero-sum than underlying interests.\n- **Shadow of the future is the master variable** — assess repeat interaction before designing any mechanism.\n- **Tit-for-Tat requires unambiguous defection detection** — define what constitutes defection before committing to reciprocity.\n- **Forgiveness is structurally required** — Grim Trigger is not evolutionarily stable; build recovery paths in.\n- **Institutions change payoff matrices** — if trust is insufficient, a contract is more reliable than repeat-interaction dynamics alone.\n\n*→ Primary sources: [references/sources.md](references/sources.md)*\n\n## Common Rationalizations\n\n**[D] = designed upfront | [O] = observed in real use. [O] entries are more valuable.**\n\n| Fake move | Reality |\n|---|---|\n| [D] **\"This is zero-sum — nothing to cooperate on.\"** | Map interests vs. positions first. Money may be zero-sum; timing, quality, risk, and relationship usually are not. |\n| [D] **Cooperation impossible because of lack of trust.** | Trust is not a prerequisite — payoff structure and shadow of the future are. Axelrod's tournament showed cooperation among purely self-interested strategies with no trust or communication. |\n| [D] **Designing cooperation mechanisms for one-shot interactions.** | All reciprocity/reputation mechanisms require repeated interactions. One-shot contexts need external enforcement or one-shot interest alignment. |\n| [D] **Assuming identifying non-zero-sum structure is sufficient.** | Structure is necessary but not sufficient — shadow of future must be strong, defection detectable, mechanism designed. |\n| [D] **Using Tit-for-Tat where defection is ambiguous.** | Produces retaliatory spirals from misinterpretation. Use Generous Tit-for-Tat in ambiguous contexts. |\n| [D] **Treating non-zero-sum as a negotiation trick.** | Requires honest interest-mapping of both parties. Tactical framing without it produces deals that collapse. |\n| [D] **Conflating non-zero-sum potential with guaranteed mutual benefit.** | Mutual gain is *possible* — not automatic. Capturing the dividend requires coordination or institutional design. |\n| *→ Add [O] entries here after each real use — paste the actual failure pattern* | *What went wrong and why* |\n\n## Red Flags\n\n- Zero-sum declared from positions alone, interests not mapped\n- Cooperation mechanism designed for a one-shot interaction\n- Shadow of the future not assessed before choosing reciprocity\n- Defection is ambiguous — Tit-for-Tat will misfire\n- No recovery path after first defection; cooperation assumed to follow automatically from structure alone\n\n## Verification\n\n- [ ] Positions vs. interests mapped for both parties\n- [ ] Payoff matrix: does mutual cooperation produce more total value than mutual defection?\n- [ ] Non-zero-sum gap (cooperation dividend) quantified or ranked\n- [ ] Shadow of the future assessed\n- [ ] Cooperation mechanism matched to relationship structure\n- [ ] Defection detection criteria defined; recovery path designed\n\n---\n*Part of **deciqAI Knowledge Skills** — 164 open-source thinking skills that make rigor executable for AI agents. The same skills power every deciqAI agent, which runs them autonomously to operate your company. **See it run → https://www.deciqai.com/c/non-zero-sum** · ⭐ Star the repo → https://github.com/deciqAI/knowledge-skills · Contributions welcome.*\n\nFile v1.0.3:_meta.json\n\n{\n  \"ownerId\": \"kn754b8sk22s8c6gjxt02bftbn88q7ye\",\n  \"slug\": \"non-zero-sum\",\n  \"version\": \"1.0.3\",\n  \"publishedAt\": 1783509132955\n}\n\nFile v1.0.3:references/sources.md\n\n# Sources — non-zero-sum\n\n> *Primary sources for the [non-zero-sum](../SKILL.md) skill.*\n\n- **Axelrod, Robert.** *The Evolution of Cooperation.* Basic Books, 1984. **Primary source for the tournament, Tit-for-Tat results, and the conditions for cooperation.** Verbatim Overview quote from ch. 1. https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/\n- **Axelrod, Robert.** \"Effective Choice in the Prisoner's Dilemma.\" *Journal of Conflict Resolution* 24, no. 1 (1980): 3–25. **First academic publication of the tournament results.** https://doi.org/10.1177/002200278002400101\n- **Wright, Robert.** *Nonzero: The Logic of Human Destiny.* Pantheon, 2000. **Primary source for the historical-accumulation thesis.** Verbatim Overview quote from the Introduction. The book extends Axelrod's framework across human history, from hunter-gatherer trade to the emergence of nation-states.\n- **Rapoport, Anatol, and Chammah, Albert M.** *Prisoner's Dilemma: A Study in Conflict and Cooperation.* University of Michigan Press, 1965. **Primary source for the Prisoner's Dilemma framework** on which Axelrod's tournament is built. Documents the payoff structure and early empirical work on cooperation.\n- **Nowak, Martin A., and May, Robert M.** \"Evolutionary Games and Spatial Chaos.\" *Nature* 359 (1992): 826–829. https://doi.org/10.1038/359826a0 — Extends Axelrod's results to spatial structure, showing that cooperation can emerge and persist even when reputation and direct reciprocity are absent, through spatial clustering of cooperators.\n\n**Not cited and why:** Popular descriptions of \"win-win thinking\" as a personality trait or negotiation attitude (as in Stephen Covey's *7 Habits of Highly Effective People*) are not cited here — this skill grounds non-zero-sum analysis in payoff-structure mathematics and evolutionary stability, not in motivational or attitudinal frameworks. Covey's framing is inspirational; Axelrod's is analytical.\n\nFile v1.0.3:examples/axelrods-computer-tournament-1980.md\n\n# Method in Action: Axelrod's Computer Tournament (1980)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nPrimary-source-documented case. Axelrod ran the first computer Prisoner's Dilemma tournament in 1980, inviting submissions from specialists in game theory across multiple disciplines. He ran a second tournament in 1981 with 62 entries. Both are fully documented in *The Evolution of Cooperation* (1984).\n\n**Step 1 — Positions vs. interests:**\nIn the Prisoner's Dilemma (as in most real strategic interactions), the *position* of each player is \"defect if the other defects, cooperate only if cooperation is guaranteed.\" The *interest* of each player is to maximize total accumulated payoff over repeated interactions. These are not the same.\n\n**Step 2 — Payoff matrix:**\nMutual cooperation: both players receive R (reward). Mutual defection: both receive P (punishment, worse than R). Temptation: one defects while the other cooperates — defector receives T (temptation, highest single-round payoff); cooperator receives S (sucker's payoff, lowest). The standard ordering: T > R > P > S. The non-zero-sum gap: if both cooperate repeatedly (R per round) vs. if both defect repeatedly (P per round), the cooperation stream produces more total value. The gap is the non-zero-sum dividend.\n\n**Step 3 — Shadow of the future:**\nThe tournament was designed as iterated (indefinitely repeated) interactions. Axelrod showed mathematically that the minimum condition for Tit-for-Tat to be the stable strategy is: the discount factor (how much each player values future payoffs) must exceed (T − R) / (T − P). When interactions are repeated and future payoffs are valued, defection becomes irrational even for purely self-interested players.\n\n**Step 4 — Cooperation mechanism:**\nDirect reciprocity (Tit-for-Tat) was the winning mechanism in both tournaments. Tit-for-Tat's structural properties: (a) it starts cooperating (not exploitable through pre-emptive defection); (b) it retaliates immediately (defectors receive P immediately, not with delay); (c) it forgives after one retaliation (the relationship can recover, unlike strategies that defect forever after one betrayal). These properties map precisely to what makes cooperation self-sustaining.\n\n**Step 5 — First move:**\nAxelrod's result: the optimal first move is unconditional cooperation, combined with credible and immediate retaliation capability. Strategies that started defecting never recovered: they generated defection spirals that left both parties worse off than the mutual cooperation equilibrium.\n\n**What the tournament shows:** Cooperation can emerge and be sustained in non-zero-sum repeated interactions *without* any central authority, enforcement mechanism, or moral instruction. The self-sustaining mechanism is the payoff structure itself, combined with a sufficiently strong shadow of the future. The implication for institutional design: if you want cooperation, ensure the interaction is repeated, make defection immediately visible, and create recovery paths after retaliation.\n\n**Source:** Axelrod, Robert. *The Evolution of Cooperation.* Basic Books, 1984. The complete tournament design, results, and theoretical framework are in chapters 1–5. Mathematical proofs for the stability conditions are in the Appendix.\n\nFile v1.0.3:skill-card.md\n\n## Description: <br>\nHelps agents analyze negotiations, conflicts, and incentive designs for latent mutual-gain opportunities using payoff structure, future interaction, and cooperation mechanisms. <br>\n\nThis skill is ready for commercial/non-commercial use. <br>\n\n## Publisher: <br>\n[deciqai](https://clawhub.ai/user/deciqai) <br>\n\n### License/Terms of Use: <br>\nMIT-0 <br>\n\n\n## Use Case: <br>\nAgents and their users use this skill to evaluate whether a deadlocked negotiation, conflict, platform, contract, or institution can create value for multiple parties. It guides the agent to map interests, build a payoff matrix, assess repeat interaction, choose a cooperation mechanism, and propose a resilient first move. <br>\n\n### Deployment Geography for Use: <br>\nGlobal <br>\n\n## Known Risks and Mitigations: <br>\nRisk: The skill provides advisory reasoning that could shape negotiation or cooperation advice without executing code or accessing data. <br>\nMitigation: Treat outputs as decision support and review the proposed payoff assumptions, incentives, and first moves before relying on them. <br>\nRisk: Users may include sensitive negotiation details while asking for analysis. <br>\nMitigation: Avoid sharing confidential details unless they are appropriate for the active agent session and necessary for the analysis. <br>\n\n\n## Reference(s): <br>\n- [Primary Sources](references/sources.md) <br>\n- [Axelrod's Computer Tournament Example](examples/axelrods-computer-tournament-1980.md) <br>\n- [The Evolution of Cooperation](https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/) <br>\n- [Effective Choice in the Prisoner's Dilemma](https://doi.org/10.1177/002200278002400101) <br>\n- [Evolutionary Games and Spatial Chaos](https://doi.org/10.1038/359826a0) <br>\n\n\n## Skill Output: <br>\n**Output Type(s):** [text, markdown, guidance] <br>\n**Output Format:** [Markdown analysis with tables and short action guidance] <br>\n**Output Parameters:** [1D] <br>\n**Other Properties Related to Output:** [Produces a structured Non-Zero-Sum Analysis with positions, interests, payoff matrix, cooperation mechanism, first move, defection signal, and recovery path.] <br>\n\n## Skill Version(s): <br>\n1.0.3 (source: server release evidence) <br>\n\n## Ethical Considerations: <br>\nUsers should evaluate whether this skill is appropriate for their environment, review any generated or modified files before relying on them, and apply their organization's safety, security, and compliance requirements before deployment. <br>\n\nArchive v1.0.2: 5 files, 8746 bytes\n\nFiles: examples/axelrods-computer-tournament-1980.md (3322b), references/sources.md (1987b), skill-card.md (2500b), SKILL.md (9598b), _meta.json (131b)\n\nFile v1.0.2:SKILL.md\n\n---\nname: non-zero-sum\ndescription: \"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past this standoff'; a negotiation or conflict feels deadlocked; you're designing a platform, contract, or institution that needs to align competing parties.\n  Do NOT activate when: the resource pool is genuinely fixed and one-shot with no side effects (true zero-sum); the conflict is identity- or values-based with no concrete trade that creates net value.\"\n---\n\n# Non-Zero-Sum\n\n## Overview\n\nA non-zero-sum interaction is one where mutual gain (or mutual loss) is possible — the parties' outcomes do not simply cancel each other out. Most real-world conflicts and negotiations are not zero-sum, but *feel* zero-sum because we focus on the visible resource rather than underlying interests. Robert Axelrod's computer tournament showed cooperation can emerge without central authority when interactions repeat and the future is valued. Robert Wright extended this: the arc of history is driven by accumulating non-zero-sum arrangements — specialization, trade, institutions.\n\n**Compose with neighbors:** Use prisoners-dilemma to model the payoff structure first. Use repeated-games-reputation when the key variable is whether interaction repeats. Use nash-equilibrium to find whether a stable cooperative outcome exists.\n\n## When to Use\n\n- A negotiation or conflict is deadlocked in zero-sum framing — each side treating every gain as the other's loss\n- You want to find latent cooperative value in an adversarial relationship\n- Designing an institution, platform, or contract to align incentives for competing parties\n- Someone says: *\"this is win-lose,\" \"we can't both win,\" \"what's in it for them,\" \"could we cooperate instead of compete?\"*\n\n**When NOT to use:**\n- Genuinely fixed-pool, one-shot interaction with no side effects — non-zero-sum framing is wishful, not analytical\n- Interests are fundamentally incompatible (ideological, identity-based) with no concrete trade creating net value\n- The real constraint is power asymmetry → use batna-zopa instead\n\n## Coaching Novices (Adaptive Front Door)\n\n- **Engine mode:** user has a specific standoff or competitive dynamic → run The Process directly.\n- **Coach mode:** user is unfamiliar or has no concrete case → guide step by step.\n\nIn Coach mode, respond one step at a time. Each [WAIT] is a hard stop — output only that step's question, then stop.\n\n1. One-line what-it-is: non-zero-sum means both parties can gain — or both can lose — from an interaction. Most conflicts feel zero-sum but aren't.\n2. Check fit against When to Use / When NOT to use — if genuinely zero-sum, redirect to zero-sum negotiation strategy.\n3. Elicit their specific standoff or competitive dynamic. \"How do I negotiate better?\" is not workable; a concrete situation is. > **[WAIT — do not advance until user responds]**\n4. Walk through the payoff structure, shadow of the future, and cooperation structure steps one at a time with their input. > **[WAIT — do not advance until user responds]**\n5. Close by naming the specific non-zero-sum mechanism that creates cooperative potential — the concrete thing both parties gain by cooperating that neither gets by fighting. > **[WAIT — do not advance until user responds]**\n\n## The Process\n\nFive steps producing a **Non-Zero-Sum Analysis**. **Stop rule:** If Step 2 reveals a genuinely zero-sum payoff structure, stop and shift to zero-sum strategy.\n\n1. **Map positions vs. underlying interests.** Positions are often zero-sum; interests often are not. A wage negotiation (zero-sum on money) may be non-zero-sum on scheduling, job security, and productivity bonuses.\n2. **Construct the payoff matrix.** Is total value fixed (zero-sum) or variable (non-zero-sum)? Identify mutual-defection outcomes, mutual-cooperation outcomes, and the temptation payoff. If mutual cooperation produces more total value, the interaction is non-zero-sum.\n3. **Assess the shadow of the future.** Will parties interact again? How much value is in future vs. this one interaction? Are there reputational effects that make defection costly beyond this round?\n4. **Identify the cooperation mechanism.** (a) direct reciprocity (Tit-for-Tat); (b) reputation (third parties reward cooperators); (c) institution (contract or platform that makes defection costly); (d) reframing (make mutual gain visible). Match mechanism to relationship structure.\n5. **Design the first move.** Cooperative enough to invite reciprocation; clear enough that defection is unambiguous; resilient enough to survive one defection without collapsing.\n\n### Output: Non-Zero-Sum Analysis\n\n```\n# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>\n```\n\n*→ Method in Action: [Axelrod's Computer Tournament (1980)](examples/axelrods-computer-tournament-1980.md)*\n\n## Cooperation Packs\n\n- **Business negotiations:** Buyer/seller zero-sum on price; non-zero-sum on volume, reliability, and timing. Mechanisms: long-term contracts, quality bonuses, co-investment.\n- **Platform / ecosystem:** Platform wants revenue; developers want distribution. Mechanism: tiered fees decreasing with scale (App Store / Stripe Connect logic).\n- **International trade:** Positions conflict on surplus; interests align on market access and supply chain resilience. Mechanism: WTO rules, bilateral reciprocity, supply chain interdependence.\n\n## Applying It Well\n\n- **Map interests before concluding zero-sum** — positions are almost always more zero-sum than underlying interests.\n- **Shadow of the future is the master variable** — assess repeat interaction before designing any mechanism.\n- **Tit-for-Tat requires unambiguous defection detection** — define what constitutes defection before committing to reciprocity.\n- **Forgiveness is structurally required** — Grim Trigger is not evolutionarily stable; build recovery paths in.\n- **Institutions change payoff matrices** — if trust is insufficient, a contract is more reliable than repeat-interaction dynamics alone.\n\n*→ Primary sources: [references/sources.md](references/sources.md)*\n\n## Common Rationalizations\n\n**[D] = designed upfront | [O] = observed in real use. [O] entries are more valuable.**\n\n| Fake move | Reality |\n|---|---|\n| [D] **\"This is zero-sum — nothing to cooperate on.\"** | Map interests vs. positions first. Money may be zero-sum; timing, quality, risk, and relationship usually are not. |\n| [D] **Cooperation impossible because of lack of trust.** | Trust is not a prerequisite — payoff structure and shadow of the future are. Axelrod's tournament showed cooperation among purely self-interested strategies with no trust or communication. |\n| [D] **Designing cooperation mechanisms for one-shot interactions.** | All reciprocity/reputation mechanisms require repeated interactions. One-shot contexts need external enforcement or one-shot interest alignment. |\n| [D] **Assuming identifying non-zero-sum structure is sufficient.** | Structure is necessary but not sufficient — shadow of future must be strong, defection detectable, mechanism designed. |\n| [D] **Using Tit-for-Tat where defection is ambiguous.** | Produces retaliatory spirals from misinterpretation. Use Generous Tit-for-Tat in ambiguous contexts. |\n| [D] **Treating non-zero-sum as a negotiation trick.** | Requires honest interest-mapping of both parties. Tactical framing without it produces deals that collapse. |\n| [D] **Conflating non-zero-sum potential with guaranteed mutual benefit.** | Mutual gain is *possible* — not automatic. Capturing the dividend requires coordination or institutional design. |\n| *→ Add [O] entries here after each real use — paste the actual failure pattern* | *What went wrong and why* |\n\n## Red Flags\n\n- Zero-sum declared from positions alone, interests not mapped\n- Cooperation mechanism designed for a one-shot interaction\n- Shadow of the future not assessed before choosing reciprocity\n- Defection is ambiguous — Tit-for-Tat will misfire\n- No recovery path after first defection; cooperation assumed to follow automatically from structure alone\n\n## Verification\n\n- [ ] Positions vs. interests mapped for both parties\n- [ ] Payoff matrix: does mutual cooperation produce more total value than mutual defection?\n- [ ] Non-zero-sum gap (cooperation dividend) quantified or ranked\n- [ ] Shadow of the future assessed\n- [ ] Cooperation mechanism matched to relationship structure\n- [ ] Defection detection criteria defined; recovery path designed\n\n---\n*Part of **deciqAI Knowledge Skills** — 163 open-source thinking skills that make rigor executable for AI agents. The same skills power every deciqAI agent, which runs them autonomously to operate your company. **See it run → https://www.deciqai.com/skills/non-zero-sum?utm_source=clawhub&utm_medium=marketplace&utm_campaign=knowledge-skills&utm_content=non-zero-sum** · ⭐ Star the repo → https://github.com/deciqAI/knowledge-skills · Contributions welcome.*\n\nFile v1.0.2:_meta.json\n\n{\n  \"ownerId\": \"kn754b8sk22s8c6gjxt02bftbn88q7ye\",\n  \"slug\": \"non-zero-sum\",\n  \"version\": \"1.0.2\",\n  \"publishedAt\": 1783472218386\n}\n\nFile v1.0.2:references/sources.md\n\n# Sources — non-zero-sum\n\n> *Primary sources for the [non-zero-sum](../SKILL.md) skill.*\n\n- **Axelrod, Robert.** *The Evolution of Cooperation.* Basic Books, 1984. **Primary source for the tournament, Tit-for-Tat results, and the conditions for cooperation.** Verbatim Overview quote from ch. 1. https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/\n- **Axelrod, Robert.** \"Effective Choice in the Prisoner's Dilemma.\" *Journal of Conflict Resolution* 24, no. 1 (1980): 3–25. **First academic publication of the tournament results.** https://doi.org/10.1177/002200278002400101\n- **Wright, Robert.** *Nonzero: The Logic of Human Destiny.* Pantheon, 2000. **Primary source for the historical-accumulation thesis.** Verbatim Overview quote from the Introduction. The book extends Axelrod's framework across human history, from hunter-gatherer trade to the emergence of nation-states.\n- **Rapoport, Anatol, and Chammah, Albert M.** *Prisoner's Dilemma: A Study in Conflict and Cooperation.* University of Michigan Press, 1965. **Primary source for the Prisoner's Dilemma framework** on which Axelrod's tournament is built. Documents the payoff structure and early empirical work on cooperation.\n- **Nowak, Martin A., and May, Robert M.** \"Evolutionary Games and Spatial Chaos.\" *Nature* 359 (1992): 826–829. https://doi.org/10.1038/359826a0 — Extends Axelrod's results to spatial structure, showing that cooperation can emerge and persist even when reputation and direct reciprocity are absent, through spatial clustering of cooperators.\n\n**Not cited and why:** Popular descriptions of \"win-win thinking\" as a personality trait or negotiation attitude (as in Stephen Covey's *7 Habits of Highly Effective People*) are not cited here — this skill grounds non-zero-sum analysis in payoff-structure mathematics and evolutionary stability, not in motivational or attitudinal frameworks. Covey's framing is inspirational; Axelrod's is analytical.\n\nFile v1.0.2:examples/axelrods-computer-tournament-1980.md\n\n# Method in Action: Axelrod's Computer Tournament (1980)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nPrimary-source-documented case. Axelrod ran the first computer Prisoner's Dilemma tournament in 1980, inviting submissions from specialists in game theory across multiple disciplines. He ran a second tournament in 1981 with 62 entries. Both are fully documented in *The Evolution of Cooperation* (1984).\n\n**Step 1 — Positions vs. interests:**\nIn the Prisoner's Dilemma (as in most real strategic interactions), the *position* of each player is \"defect if the other defects, cooperate only if cooperation is guaranteed.\" The *interest* of each player is to maximize total accumulated payoff over repeated interactions. These are not the same.\n\n**Step 2 — Payoff matrix:**\nMutual cooperation: both players receive R (reward). Mutual defection: both receive P (punishment, worse than R). Temptation: one defects while the other cooperates — defector receives T (temptation, highest single-round payoff); cooperator receives S (sucker's payoff, lowest). The standard ordering: T > R > P > S. The non-zero-sum gap: if both cooperate repeatedly (R per round) vs. if both defect repeatedly (P per round), the cooperation stream produces more total value. The gap is the non-zero-sum dividend.\n\n**Step 3 — Shadow of the future:**\nThe tournament was designed as iterated (indefinitely repeated) interactions. Axelrod showed mathematically that the minimum condition for Tit-for-Tat to be the stable strategy is: the discount factor (how much each player values future payoffs) must exceed (T − R) / (T − P). When interactions are repeated and future payoffs are valued, defection becomes irrational even for purely self-interested players.\n\n**Step 4 — Cooperation mechanism:**\nDirect reciprocity (Tit-for-Tat) was the winning mechanism in both tournaments. Tit-for-Tat's structural properties: (a) it starts cooperating (not exploitable through pre-emptive defection); (b) it retaliates immediately (defectors receive P immediately, not with delay); (c) it forgives after one retaliation (the relationship can recover, unlike strategies that defect forever after one betrayal). These properties map precisely to what makes cooperation self-sustaining.\n\n**Step 5 — First move:**\nAxelrod's result: the optimal first move is unconditional cooperation, combined with credible and immediate retaliation capability. Strategies that started defecting never recovered: they generated defection spirals that left both parties worse off than the mutual cooperation equilibrium.\n\n**What the tournament shows:** Cooperation can emerge and be sustained in non-zero-sum repeated interactions *without* any central authority, enforcement mechanism, or moral instruction. The self-sustaining mechanism is the payoff structure itself, combined with a sufficiently strong shadow of the future. The implication for institutional design: if you want cooperation, ensure the interaction is repeated, make defection immediately visible, and create recovery paths after retaliation.\n\n**Source:** Axelrod, Robert. *The Evolution of Cooperation.* Basic Books, 1984. The complete tournament design, results, and theoretical framework are in chapters 1–5. Mathematical proofs for the stability conditions are in the Appendix.\n\nFile v1.0.2:skill-card.md\n\n## Description: <br>\nGuides an agent through non-zero-sum analysis for negotiations, conflicts, platforms, contracts, and institutions where mutual gain may be possible. <br>\n\nThis skill is ready for commercial/non-commercial use. <br>\n\n## Publisher: <br>\n[deciqai](https://clawhub.ai/user/deciqai) <br>\n\n### License/Terms of Use: <br>\nMIT-0 <br>\n\n\n## Use Case: <br>\nEmployees, external users, developers, and business operators use this skill to test whether a deadlocked negotiation or competitive relationship has cooperative value. It produces a structured analysis of interests, payoff structure, repeat interaction, cooperation mechanisms, and a first move. <br>\n\n### Deployment Geography for Use: <br>\nGlobal <br>\n\n## Known Risks and Mitigations: <br>\nRisk: The skill can make a conflict appear more cooperative than it is if the user has not confirmed that interests, trade space, and repeat interaction actually exist. <br>\nMitigation: Use the skill's stop rule and verification checklist to map positions versus interests, test whether mutual cooperation creates more total value, and redirect when the situation is genuinely zero-sum. <br>\nRisk: The skill links to external academic and publisher references. <br>\nMitigation: Treat external links as references only and review them under the user's normal browsing and citation policies. <br>\n\n\n## Reference(s): <br>\n- [Non-Zero-Sum Sources](references/sources.md) <br>\n- [Axelrod's Computer Tournament Example](examples/axelrods-computer-tournament-1980.md) <br>\n- [The Evolution of Cooperation](https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/) <br>\n- [Effective Choice in the Prisoner's Dilemma](https://doi.org/10.1177/002200278002400101) <br>\n- [Evolutionary Games and Spatial Chaos](https://doi.org/10.1038/359826a0) <br>\n\n\n## Skill Output: <br>\n**Output Type(s):** [Text, Markdown, Guidance] <br>\n**Output Format:** [Markdown analysis with tables and short recommendations] <br>\n**Output Parameters:** [1D] <br>\n**Other Properties Related to Output:** [May ask step-by-step questions in coach mode before producing the full analysis.] <br>\n\n## Skill Version(s): <br>\n1.0.2 (source: server release metadata) <br>\n\n## Ethical Considerations: <br>\nUsers should evaluate whether this skill is appropriate for their environment, review any generated or modified files before relying on them, and apply their organization's safety, security, and compliance requirements before deployment. <br>\n\nArchive v1.0.1: 5 files, 8675 bytes\n\nFiles: examples/axelrods-computer-tournament-1980.md (3322b), references/sources.md (1987b), skill-card.md (2501b), SKILL.md (9478b), _meta.json (131b)\n\nFile v1.0.1:SKILL.md\n\n---\nname: non-zero-sum\ndescription: \"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past this standoff'; a negotiation or conflict feels deadlocked; you're designing a platform, contract, or institution that needs to align competing parties.\n  Do NOT activate when: the resource pool is genuinely fixed and one-shot with no side effects (true zero-sum); the conflict is identity- or values-based with no concrete trade that creates net value.\"\n---\n\n# Non-Zero-Sum\n\n## Overview\n\nA non-zero-sum interaction is one where mutual gain (or mutual loss) is possible — the parties' outcomes do not simply cancel each other out. Most real-world conflicts and negotiations are not zero-sum, but *feel* zero-sum because we focus on the visible resource rather than underlying interests. Robert Axelrod's computer tournament showed cooperation can emerge without central authority when interactions repeat and the future is valued. Robert Wright extended this: the arc of history is driven by accumulating non-zero-sum arrangements — specialization, trade, institutions.\n\n**Compose with neighbors:** Use [prisoners-dilemma](../prisoners-dilemma/SKILL.md) to model the payoff structure first. Use [repeated-games-reputation](../repeated-games-reputation/SKILL.md) when the key variable is whether interaction repeats. Use [nash-equilibrium](../nash-equilibrium/SKILL.md) to find whether a stable cooperative outcome exists.\n\n## When to Use\n\n- A negotiation or conflict is deadlocked in zero-sum framing — each side treating every gain as the other's loss\n- You want to find latent cooperative value in an adversarial relationship\n- Designing an institution, platform, or contract to align incentives for competing parties\n- Someone says: *\"this is win-lose,\" \"we can't both win,\" \"what's in it for them,\" \"could we cooperate instead of compete?\"*\n\n**When NOT to use:**\n- Genuinely fixed-pool, one-shot interaction with no side effects — non-zero-sum framing is wishful, not analytical\n- Interests are fundamentally incompatible (ideological, identity-based) with no concrete trade creating net value\n- The real constraint is power asymmetry → use [batna-zopa](../batna-zopa/SKILL.md) instead\n\n## Coaching Novices (Adaptive Front Door)\n\n- **Engine mode:** user has a specific standoff or competitive dynamic → run The Process directly.\n- **Coach mode:** user is unfamiliar or has no concrete case → guide step by step.\n\nIn Coach mode, respond one step at a time. Each [WAIT] is a hard stop — output only that step's question, then stop.\n\n1. One-line what-it-is: non-zero-sum means both parties can gain — or both can lose — from an interaction. Most conflicts feel zero-sum but aren't.\n2. Check fit against When to Use / When NOT to use — if genuinely zero-sum, redirect to zero-sum negotiation strategy.\n3. Elicit their specific standoff or competitive dynamic. \"How do I negotiate better?\" is not workable; a concrete situation is. > **[WAIT — do not advance until user responds]**\n4. Walk through the payoff structure, shadow of the future, and cooperation structure steps one at a time with their input. > **[WAIT — do not advance until user responds]**\n5. Close by naming the specific non-zero-sum mechanism that creates cooperative potential — the concrete thing both parties gain by cooperating that neither gets by fighting. > **[WAIT — do not advance until user responds]**\n\n## The Process\n\nFive steps producing a **Non-Zero-Sum Analysis**. **Stop rule:** If Step 2 reveals a genuinely zero-sum payoff structure, stop and shift to zero-sum strategy.\n\n1. **Map positions vs. underlying interests.** Positions are often zero-sum; interests often are not. A wage negotiation (zero-sum on money) may be non-zero-sum on scheduling, job security, and productivity bonuses.\n2. **Construct the payoff matrix.** Is total value fixed (zero-sum) or variable (non-zero-sum)? Identify mutual-defection outcomes, mutual-cooperation outcomes, and the temptation payoff. If mutual cooperation produces more total value, the interaction is non-zero-sum.\n3. **Assess the shadow of the future.** Will parties interact again? How much value is in future vs. this one interaction? Are there reputational effects that make defection costly beyond this round?\n4. **Identify the cooperation mechanism.** (a) direct reciprocity (Tit-for-Tat); (b) reputation (third parties reward cooperators); (c) institution (contract or platform that makes defection costly); (d) reframing (make mutual gain visible). Match mechanism to relationship structure.\n5. **Design the first move.** Cooperative enough to invite reciprocation; clear enough that defection is unambiguous; resilient enough to survive one defection without collapsing.\n\n### Output: Non-Zero-Sum Analysis\n\n```\n# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>\n```\n\n*→ Method in Action: [Axelrod's Computer Tournament (1980)](examples/axelrods-computer-tournament-1980.md)*\n\n## Cooperation Packs\n\n- **Business negotiations:** Buyer/seller zero-sum on price; non-zero-sum on volume, reliability, and timing. Mechanisms: long-term contracts, quality bonuses, co-investment.\n- **Platform / ecosystem:** Platform wants revenue; developers want distribution. Mechanism: tiered fees decreasing with scale (App Store / Stripe Connect logic).\n- **International trade:** Positions conflict on surplus; interests align on market access and supply chain resilience. Mechanism: WTO rules, bilateral reciprocity, supply chain interdependence.\n\n## Applying It Well\n\n- **Map interests before concluding zero-sum** — positions are almost always more zero-sum than underlying interests.\n- **Shadow of the future is the master variable** — assess repeat interaction before designing any mechanism.\n- **Tit-for-Tat requires unambiguous defection detection** — define what constitutes defection before committing to reciprocity.\n- **Forgiveness is structurally required** — Grim Trigger is not evolutionarily stable; build recovery paths in.\n- **Institutions change payoff matrices** — if trust is insufficient, a contract is more reliable than repeat-interaction dynamics alone.\n\n*→ Primary sources: [references/sources.md](references/sources.md)*\n\n## Common Rationalizations\n\n**[D] = designed upfront | [O] = observed in real use. [O] entries are more valuable.**\n\n| Fake move | Reality |\n|---|---|\n| [D] **\"This is zero-sum — nothing to cooperate on.\"** | Map interests vs. positions first. Money may be zero-sum; timing, quality, risk, and relationship usually are not. |\n| [D] **Cooperation impossible because of lack of trust.** | Trust is not a prerequisite — payoff structure and shadow of the future are. Axelrod's tournament showed cooperation among purely self-interested strategies with no trust or communication. |\n| [D] **Designing cooperation mechanisms for one-shot interactions.** | All reciprocity/reputation mechanisms require repeated interactions. One-shot contexts need external enforcement or one-shot interest alignment. |\n| [D] **Assuming identifying non-zero-sum structure is sufficient.** | Structure is necessary but not sufficient — shadow of future must be strong, defection detectable, mechanism designed. |\n| [D] **Using Tit-for-Tat where defection is ambiguous.** | Produces retaliatory spirals from misinterpretation. Use Generous Tit-for-Tat in ambiguous contexts. |\n| [D] **Treating non-zero-sum as a negotiation trick.** | Requires honest interest-mapping of both parties. Tactical framing without it produces deals that collapse. |\n| [D] **Conflating non-zero-sum potential with guaranteed mutual benefit.** | Mutual gain is *possible* — not automatic. Capturing the dividend requires coordination or institutional design. |\n| *→ Add [O] entries here after each real use — paste the actual failure pattern* | *What went wrong and why* |\n\n## Red Flags\n\n- Zero-sum declared from positions alone, interests not mapped\n- Cooperation mechanism designed for a one-shot interaction\n- Shadow of the future not assessed before choosing reciprocity\n- Defection is ambiguous — Tit-for-Tat will misfire\n- No recovery path after first defection; cooperation assumed to follow automatically from structure alone\n\n## Verification\n\n- [ ] Positions vs. interests mapped for both parties\n- [ ] Payoff matrix: does mutual cooperation produce more total value than mutual defection?\n- [ ] Non-zero-sum gap (cooperation dividend) quantified or ranked\n- [ ] Shadow of the future assessed\n- [ ] Cooperation mechanism matched to relationship structure\n- [ ] Defection detection criteria defined; recovery path designed\n\n---\n*Part of **deciqAI Knowledge Skills** — open-source thinking skills that make rigor executable for AI agents. Built by deciqAI · https://deciqai.com · Contributions welcome — see the template at the repo root.*\n\nFile v1.0.1:_meta.json\n\n{\n  \"ownerId\": \"kn754b8sk22s8c6gjxt02bftbn88q7ye\",\n  \"slug\": \"non-zero-sum\",\n  \"version\": \"1.0.1\",\n  \"publishedAt\": 1783463414439\n}\n\nFile v1.0.1:references/sources.md\n\n# Sources — non-zero-sum\n\n> *Primary sources for the [non-zero-sum](../SKILL.md) skill.*\n\n- **Axelrod, Robert.** *The Evolution of Cooperation.* Basic Books, 1984. **Primary source for the tournament, Tit-for-Tat results, and the conditions for cooperation.** Verbatim Overview quote from ch. 1. https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/\n- **Axelrod, Robert.** \"Effective Choice in the Prisoner's Dilemma.\" *Journal of Conflict Resolution* 24, no. 1 (1980): 3–25. **First academic publication of the tournament results.** https://doi.org/10.1177/002200278002400101\n- **Wright, Robert.** *Nonzero: The Logic of Human Destiny.* Pantheon, 2000. **Primary source for the historical-accumulation thesis.** Verbatim Overview quote from the Introduction. The book extends Axelrod's framework across human history, from hunter-gatherer trade to the emergence of nation-states.\n- **Rapoport, Anatol, and Chammah, Albert M.** *Prisoner's Dilemma: A Study in Conflict and Cooperation.* University of Michigan Press, 1965. **Primary source for the Prisoner's Dilemma framework** on which Axelrod's tournament is built. Documents the payoff structure and early empirical work on cooperation.\n- **Nowak, Martin A., and May, Robert M.** \"Evolutionary Games and Spatial Chaos.\" *Nature* 359 (1992): 826–829. https://doi.org/10.1038/359826a0 — Extends Axelrod's results to spatial structure, showing that cooperation can emerge and persist even when reputation and direct reciprocity are absent, through spatial clustering of cooperators.\n\n**Not cited and why:** Popular descriptions of \"win-win thinking\" as a personality trait or negotiation attitude (as in Stephen Covey's *7 Habits of Highly Effective People*) are not cited here — this skill grounds non-zero-sum analysis in payoff-structure mathematics and evolutionary stability, not in motivational or attitudinal frameworks. Covey's framing is inspirational; Axelrod's is analytical.\n\nFile v1.0.1:examples/axelrods-computer-tournament-1980.md\n\n# Method in Action: Axelrod's Computer Tournament (1980)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nPrimary-source-documented case. Axelrod ran the first computer Prisoner's Dilemma tournament in 1980, inviting submissions from specialists in game theory across multiple disciplines. He ran a second tournament in 1981 with 62 entries. Both are fully documented in *The Evolution of Cooperation* (1984).\n\n**Step 1 — Positions vs. interests:**\nIn the Prisoner's Dilemma (as in most real strategic interactions), the *position* of each player is \"defect if the other defects, cooperate only if cooperation is guaranteed.\" The *interest* of each player is to maximize total accumulated payoff over repeated interactions. These are not the same.\n\n**Step 2 — Payoff matrix:**\nMutual cooperation: both players receive R (reward). Mutual defection: both receive P (punishment, worse than R). Temptation: one defects while the other cooperates — defector receives T (temptation, highest single-round payoff); cooperator receives S (sucker's payoff, lowest). The standard ordering: T > R > P > S. The non-zero-sum gap: if both cooperate repeatedly (R per round) vs. if both defect repeatedly (P per round), the cooperation stream produces more total value. The gap is the non-zero-sum dividend.\n\n**Step 3 — Shadow of the future:**\nThe tournament was designed as iterated (indefinitely repeated) interactions. Axelrod showed mathematically that the minimum condition for Tit-for-Tat to be the stable strategy is: the discount factor (how much each player values future payoffs) must exceed (T − R) / (T − P). When interactions are repeated and future payoffs are valued, defection becomes irrational even for purely self-interested players.\n\n**Step 4 — Cooperation mechanism:**\nDirect reciprocity (Tit-for-Tat) was the winning mechanism in both tournaments. Tit-for-Tat's structural properties: (a) it starts cooperating (not exploitable through pre-emptive defection); (b) it retaliates immediately (defectors receive P immediately, not with delay); (c) it forgives after one retaliation (the relationship can recover, unlike strategies that defect forever after one betrayal). These properties map precisely to what makes cooperation self-sustaining.\n\n**Step 5 — First move:**\nAxelrod's result: the optimal first move is unconditional cooperation, combined with credible and immediate retaliation capability. Strategies that started defecting never recovered: they generated defection spirals that left both parties worse off than the mutual cooperation equilibrium.\n\n**What the tournament shows:** Cooperation can emerge and be sustained in non-zero-sum repeated interactions *without* any central authority, enforcement mechanism, or moral instruction. The self-sustaining mechanism is the payoff structure itself, combined with a sufficiently strong shadow of the future. The implication for institutional design: if you want cooperation, ensure the interaction is repeated, make defection immediately visible, and create recovery paths after retaliation.\n\n**Source:** Axelrod, Robert. *The Evolution of Cooperation.* Basic Books, 1984. The complete tournament design, results, and theoretical framework are in chapters 1–5. Mathematical proofs for the stability conditions are in the Appendix.\n\nFile v1.0.1:skill-card.md\n\n## Description: <br>\nGuides agents through game-theory analysis to identify mutual-gain opportunities in negotiations, conflicts, contracts, platforms, and institutions that may appear zero-sum. <br>\n\nThis skill is ready for commercial/non-commercial use. <br>\n\n## Publisher: <br>\n[deciqai](https://clawhub.ai/user/deciqai) <br>\n\n### License/Terms of Use: <br>\nMIT-0 <br>\n\n\n## Use Case: <br>\nExternal users, developers, analysts, and operators use this skill to reframe deadlocked competitive situations, map positions against interests, evaluate payoff structures, and design cooperation mechanisms when mutual gain may be possible. <br>\n\n### Deployment Geography for Use: <br>\nGlobal <br>\n\n## Known Risks and Mitigations: <br>\nRisk: Users may treat negotiation and game-theory guidance as legal or business advice. <br>\nMitigation: Have a qualified reviewer validate recommendations before using them in legal, commercial, or high-stakes negotiations. <br>\nRisk: Incorrect assumptions about payoff structure, repeat interaction, or defection signals could lead to misleading cooperation strategies. <br>\nMitigation: Verify the positions, interests, payoff matrix, shadow of the future, defection criteria, and recovery path before acting on the analysis. <br>\n\n\n## Reference(s): <br>\n- [ClawHub skill page](https://clawhub.ai/deciqai/skills/non-zero-sum) <br>\n- [Sources - non-zero-sum](references/sources.md) <br>\n- [Axelrod's Computer Tournament example](examples/axelrods-computer-tournament-1980.md) <br>\n- [The Evolution of Cooperation](https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/) <br>\n- [Effective Choice in the Prisoner's Dilemma](https://doi.org/10.1177/002200278002400101) <br>\n- [Evolutionary Games and Spatial Chaos](https://doi.org/10.1038/359826a0) <br>\n\n\n## Skill Output: <br>\n**Output Type(s):** [Guidance, Markdown, Text] <br>\n**Output Format:** [Markdown analysis with tables and step-by-step coaching prompts] <br>\n**Output Parameters:** [1D] <br>\n**Other Properties Related to Output:** [May stop at explicit WAIT prompts in coach mode to gather user input before continuing.] <br>\n\n## Skill Version(s): <br>\n1.0.1 (source: server release evidence) <br>\n\n## Ethical Considerations: <br>\nUsers should evaluate whether this skill is appropriate for their environment, review any generated or modified files before relying on them, and apply their organization's safety, security, and compliance requirements before deployment. <br>\n\nArchive v1.0.0: 5 files, 8856 bytes\n\nFiles: examples/axelrods-computer-tournament-1980.md (3322b), references/sources.md (1987b), skill-card.md (2886b), SKILL.md (9478b), _meta.json (131b)\n\nFile v1.0.0:SKILL.md\n\n---\nname: non-zero-sum\ndescription: \"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past this standoff'; a negotiation or conflict feels deadlocked; you're designing a platform, contract, or institution that needs to align competing parties.\n  Do NOT activate when: the resource pool is genuinely fixed and one-shot with no side effects (true zero-sum); the conflict is identity- or values-based with no concrete trade that creates net value.\"\n---\n\n# Non-Zero-Sum\n\n## Overview\n\nA non-zero-sum interaction is one where mutual gain (or mutual loss) is possible — the parties' outcomes do not simply cancel each other out. Most real-world conflicts and negotiations are not zero-sum, but *feel* zero-sum because we focus on the visible resource rather than underlying interests. Robert Axelrod's computer tournament showed cooperation can emerge without central authority when interactions repeat and the future is valued. Robert Wright extended this: the arc of history is driven by accumulating non-zero-sum arrangements — specialization, trade, institutions.\n\n**Compose with neighbors:** Use [prisoners-dilemma](../prisoners-dilemma/SKILL.md) to model the payoff structure first. Use [repeated-games-reputation](../repeated-games-reputation/SKILL.md) when the key variable is whether interaction repeats. Use [nash-equilibrium](../nash-equilibrium/SKILL.md) to find whether a stable cooperative outcome exists.\n\n## When to Use\n\n- A negotiation or conflict is deadlocked in zero-sum framing — each side treating every gain as the other's loss\n- You want to find latent cooperative value in an adversarial relationship\n- Designing an institution, platform, or contract to align incentives for competing parties\n- Someone says: *\"this is win-lose,\" \"we can't both win,\" \"what's in it for them,\" \"could we cooperate instead of compete?\"*\n\n**When NOT to use:**\n- Genuinely fixed-pool, one-shot interaction with no side effects — non-zero-sum framing is wishful, not analytical\n- Interests are fundamentally incompatible (ideological, identity-based) with no concrete trade creating net value\n- The real constraint is power asymmetry → use [batna-zopa](../batna-zopa/SKILL.md) instead\n\n## Coaching Novices (Adaptive Front Door)\n\n- **Engine mode:** user has a specific standoff or competitive dynamic → run The Process directly.\n- **Coach mode:** user is unfamiliar or has no concrete case → guide step by step.\n\nIn Coach mode, respond one step at a time. Each [WAIT] is a hard stop — output only that step's question, then stop.\n\n1. One-line what-it-is: non-zero-sum means both parties can gain — or both can lose — from an interaction. Most conflicts feel zero-sum but aren't.\n2. Check fit against When to Use / When NOT to use — if genuinely zero-sum, redirect to zero-sum negotiation strategy.\n3. Elicit their specific standoff or competitive dynamic. \"How do I negotiate better?\" is not workable; a concrete situation is. > **[WAIT — do not advance until user responds]**\n4. Walk through the payoff structure, shadow of the future, and cooperation structure steps one at a time with their input. > **[WAIT — do not advance until user responds]**\n5. Close by naming the specific non-zero-sum mechanism that creates cooperative potential — the concrete thing both parties gain by cooperating that neither gets by fighting. > **[WAIT — do not advance until user responds]**\n\n## The Process\n\nFive steps producing a **Non-Zero-Sum Analysis**. **Stop rule:** If Step 2 reveals a genuinely zero-sum payoff structure, stop and shift to zero-sum strategy.\n\n1. **Map positions vs. underlying interests.** Positions are often zero-sum; interests often are not. A wage negotiation (zero-sum on money) may be non-zero-sum on scheduling, job security, and productivity bonuses.\n2. **Construct the payoff matrix.** Is total value fixed (zero-sum) or variable (non-zero-sum)? Identify mutual-defection outcomes, mutual-cooperation outcomes, and the temptation payoff. If mutual cooperation produces more total value, the interaction is non-zero-sum.\n3. **Assess the shadow of the future.** Will parties interact again? How much value is in future vs. this one interaction? Are there reputational effects that make defection costly beyond this round?\n4. **Identify the cooperation mechanism.** (a) direct reciprocity (Tit-for-Tat); (b) reputation (third parties reward cooperators); (c) institution (contract or platform that makes defection costly); (d) reframing (make mutual gain visible). Match mechanism to relationship structure.\n5. **Design the first move.** Cooperative enough to invite reciprocation; clear enough that defection is unambiguous; resilient enough to survive one defection without collapsing.\n\n### Output: Non-Zero-Sum Analysis\n\n```\n# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>\n```\n\n*→ Method in Action: [Axelrod's Computer Tournament (1980)](examples/axelrods-computer-tournament-1980.md)*\n\n## Cooperation Packs\n\n- **Business negotiations:** Buyer/seller zero-sum on price; non-zero-sum on volume, reliability, and timing. Mechanisms: long-term contracts, quality bonuses, co-investment.\n- **Platform / ecosystem:** Platform wants revenue; developers want distribution. Mechanism: tiered fees decreasing with scale (App Store / Stripe Connect logic).\n- **International trade:** Positions conflict on surplus; interests align on market access and supply chain resilience. Mechanism: WTO rules, bilateral reciprocity, supply chain interdependence.\n\n## Applying It Well\n\n- **Map interests before concluding zero-sum** — positions are almost always more zero-sum than underlying interests.\n- **Shadow of the future is the master variable** — assess repeat interaction before designing any mechanism.\n- **Tit-for-Tat requires unambiguous defection detection** — define what constitutes defection before committing to reciprocity.\n- **Forgiveness is structurally required** — Grim Trigger is not evolutionarily stable; build recovery paths in.\n- **Institutions change payoff matrices** — if trust is insufficient, a contract is more reliable than repeat-interaction dynamics alone.\n\n*→ Primary sources: [references/sources.md](references/sources.md)*\n\n## Common Rationalizations\n\n**[D] = designed upfront | [O] = observed in real use. [O] entries are more valuable.**\n\n| Fake move | Reality |\n|---|---|\n| [D] **\"This is zero-sum — nothing to cooperate on.\"** | Map interests vs. positions first. Money may be zero-sum; timing, quality, risk, and relationship usually are not. |\n| [D] **Cooperation impossible because of lack of trust.** | Trust is not a prerequisite — payoff structure and shadow of the future are. Axelrod's tournament showed cooperation among purely self-interested strategies with no trust or communication. |\n| [D] **Designing cooperation mechanisms for one-shot interactions.** | All reciprocity/reputation mechanisms require repeated interactions. One-shot contexts need external enforcement or one-shot interest alignment. |\n| [D] **Assuming identifying non-zero-sum structure is sufficient.** | Structure is necessary but not sufficient — shadow of future must be strong, defection detectable, mechanism designed. |\n| [D] **Using Tit-for-Tat where defection is ambiguous.** | Produces retaliatory spirals from misinterpretation. Use Generous Tit-for-Tat in ambiguous contexts. |\n| [D] **Treating non-zero-sum as a negotiation trick.** | Requires honest interest-mapping of both parties. Tactical framing without it produces deals that collapse. |\n| [D] **Conflating non-zero-sum potential with guaranteed mutual benefit.** | Mutual gain is *possible* — not automatic. Capturing the dividend requires coordination or institutional design. |\n| *→ Add [O] entries here after each real use — paste the actual failure pattern* | *What went wrong and why* |\n\n## Red Flags\n\n- Zero-sum declared from positions alone, interests not mapped\n- Cooperation mechanism designed for a one-shot interaction\n- Shadow of the future not assessed before choosing reciprocity\n- Defection is ambiguous — Tit-for-Tat will misfire\n- No recovery path after first defection; cooperation assumed to follow automatically from structure alone\n\n## Verification\n\n- [ ] Positions vs. interests mapped for both parties\n- [ ] Payoff matrix: does mutual cooperation produce more total value than mutual defection?\n- [ ] Non-zero-sum gap (cooperation dividend) quantified or ranked\n- [ ] Shadow of the future assessed\n- [ ] Cooperation mechanism matched to relationship structure\n- [ ] Defection detection criteria defined; recovery path designed\n\n---\n*Part of **deciqAI Knowledge Skills** — open-source thinking skills that make rigor executable for AI agents. Built by deciqAI · https://deciqai.com · Contributions welcome — see the template at the repo root.*\n\nFile v1.0.0:_meta.json\n\n{\n  \"ownerId\": \"kn754b8sk22s8c6gjxt02bftbn88q7ye\",\n  \"slug\": \"non-zero-sum\",\n  \"version\": \"1.0.0\",\n  \"publishedAt\": 1782825500204\n}\n\nFile v1.0.0:references/sources.md\n\n# Sources — non-zero-sum\n\n> *Primary sources for the [non-zero-sum](../SKILL.md) skill.*\n\n- **Axelrod, Robert.** *The Evolution of Cooperation.* Basic Books, 1984. **Primary source for the tournament, Tit-for-Tat results, and the conditions for cooperation.** Verbatim Overview quote from ch. 1. https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/\n- **Axelrod, Robert.** \"Effective Choice in the Prisoner's Dilemma.\" *Journal of Conflict Resolution* 24, no. 1 (1980): 3–25. **First academic publication of the tournament results.** https://doi.org/10.1177/002200278002400101\n- **Wright, Robert.** *Nonzero: The Logic of Human Destiny.* Pantheon, 2000. **Primary source for the historical-accumulation thesis.** Verbatim Overview quote from the Introduction. The book extends Axelrod's framework across human history, from hunter-gatherer trade to the emergence of nation-states.\n- **Rapoport, Anatol, and Chammah, Albert M.** *Prisoner's Dilemma: A Study in Conflict and Cooperation.* University of Michigan Press, 1965. **Primary source for the Prisoner's Dilemma framework** on which Axelrod's tournament is built. Documents the payoff structure and early empirical work on cooperation.\n- **Nowak, Martin A., and May, Robert M.** \"Evolutionary Games and Spatial Chaos.\" *Nature* 359 (1992): 826–829. https://doi.org/10.1038/359826a0 — Extends Axelrod's results to spatial structure, showing that cooperation can emerge and persist even when reputation and direct reciprocity are absent, through spatial clustering of cooperators.\n\n**Not cited and why:** Popular descriptions of \"win-win thinking\" as a personality trait or negotiation attitude (as in Stephen Covey's *7 Habits of Highly Effective People*) are not cited here — this skill grounds non-zero-sum analysis in payoff-structure mathematics and evolutionary stability, not in motivational or attitudinal frameworks. Covey's framing is inspirational; Axelrod's is analytical.\n\nFile v1.0.0:examples/axelrods-computer-tournament-1980.md\n\n# Method in Action: Axelrod's Computer Tournament (1980)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nPrimary-source-documented case. Axelrod ran the first computer Prisoner's Dilemma tournament in 1980, inviting submissions from specialists in game theory across multiple disciplines. He ran a second tournament in 1981 with 62 entries. Both are fully documented in *The Evolution of Cooperation* (1984).\n\n**Step 1 — Positions vs. interests:**\nIn the Prisoner's Dilemma (as in most real strategic interactions), the *position* of each player is \"defect if the other defects, cooperate only if cooperation is guaranteed.\" The *interest* of each player is to maximize total accumulated payoff over repeated interactions. These are not the same.\n\n**Step 2 — Payoff matrix:**\nMutual cooperation: both players receive R (reward). Mutual defection: both receive P (punishment, worse than R). Temptation: one defects while the other cooperates — defector receives T (temptation, highest single-round payoff); cooperator receives S (sucker's payoff, lowest). The standard ordering: T > R > P > S. The non-zero-sum gap: if both cooperate repeatedly (R per round) vs. if both defect repeatedly (P per round), the cooperation stream produces more total value. The gap is the non-zero-sum dividend.\n\n**Step 3 — Shadow of the future:**\nThe tournament was designed as iterated (indefinitely repeated) interactions. Axelrod showed mathematically that the minimum condition for Tit-for-Tat to be the stable strategy is: the discount factor (how much each player values future payoffs) must exceed (T − R) / (T − P). When interactions are repeated and future payoffs are valued, defection becomes irrational even for purely self-interested players.\n\n**Step 4 — Cooperation mechanism:**\nDirect reciprocity (Tit-for-Tat) was the winning mechanism in both tournaments. Tit-for-Tat's structural properties: (a) it starts cooperating (not exploitable through pre-emptive defection); (b) it retaliates immediately (defectors receive P immediately, not with delay); (c) it forgives after one retaliation (the relationship can recover, unlike strategies that defect forever after one betrayal). These properties map precisely to what makes cooperation self-sustaining.\n\n**Step 5 — First move:**\nAxelrod's result: the optimal first move is unconditional cooperation, combined with credible and immediate retaliation capability. Strategies that started defecting never recovered: they generated defection spirals that left both parties worse off than the mutual cooperation equilibrium.\n\n**What the tournament shows:** Cooperation can emerge and be sustained in non-zero-sum repeated interactions *without* any central authority, enforcement mechanism, or moral instruction. The self-sustaining mechanism is the payoff structure itself, combined with a sufficiently strong shadow of the future. The implication for institutional design: if you want cooperation, ensure the interaction is repeated, make defection immediately visible, and create recovery paths after retaliation.\n\n**Source:** Axelrod, Robert. *The Evolution of Cooperation.* Basic Books, 1984. The complete tournament design, results, and theoretical framework are in chapters 1–5. Mathematical proofs for the stability conditions are in the Appendix.\n\nFile v1.0.0:skill-card.md\n\n## Description: <br>\nHelps agents analyze deadlocked negotiations and competitive dynamics by identifying non-zero-sum payoff structures, cooperation mechanisms, and practical first moves. <br>\n\nThis skill is ready for commercial/non-commercial use. <br>\n\n## Publisher: <br>\n[deciqai](https://clawhub.ai/user/deciqai) <br>\n\n### License/Terms of Use: <br>\nMIT-0 <br>\n\n\n## Use Case: <br>\nExternal users, employees, and agents use this skill to test whether a conflict, negotiation, platform design, contract, or institution has cooperative value beyond a win-lose framing. It guides the agent through interest mapping, payoff structure, shadow-of-the-future assessment, cooperation mechanism selection, and a first move. <br>\n\n### Deployment Geography for Use: <br>\nGlobal <br>\n\n## Known Risks and Mitigations: <br>\nRisk: The skill can produce misleading cooperative framing if the interaction is actually fixed, one-shot, or has no concrete trade that creates net value. <br>\nMitigation: Apply the built-in stop rule: map positions versus interests, construct the payoff matrix, and redirect when Step 2 shows a genuine zero-sum structure. <br>\nRisk: Reciprocity guidance can escalate conflict when defection is ambiguous or future interaction is weak. <br>\nMitigation: Require shadow-of-the-future assessment, clear defection criteria, and a recovery path before recommending Tit-for-Tat or related mechanisms. <br>\nRisk: Operational use in ClawHub or Convex contexts may involve admin actions. <br>\nMitigation: Follow scanner guidance: use only by maintainers who understand the guided actions, and verify the target, dry-run output, confirmation flags, and authenticated account before write actions. <br>\n\n\n## Reference(s): <br>\n- [Sources - non-zero-sum](references/sources.md) <br>\n- [Axelrod's Computer Tournament (1980)](examples/axelrods-computer-tournament-1980.md) <br>\n- [The Evolution of Cooperation](https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/) <br>\n- [Effective Choice in the Prisoner's Dilemma](https://doi.org/10.1177/002200278002400101) <br>\n- [Evolutionary Games and Spatial Chaos](https://doi.org/10.1038/359826a0) <br>\n\n\n## Skill Output: <br>\n**Output Type(s):** [text, markdown, guidance] <br>\n**Output Format:** [Markdown analysis with tables, structured headings, questions, and checklists] <br>\n**Output Parameters:** [1D] <br>\n**Other Properties Related to Output:** [May stop after a single question in coach mode and wait for user input before continuing.] <br>\n\n## Skill Version(s): <br>\n1.0.0 (source: server release metadata) <br>\n\n## Ethical Considerations: <br>\nUsers should evaluate whether this skill is appropriate for their environment, review any generated or modified files before relying on them, and apply their organization's safety, security, and compliance requirements before deployment. <br>","readmeExcerpt":"Skill: Non-Zero-Sum Owner: deciqai Summary: Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past thi... Tags: latest:1.0.5 Version history: v1.0.5 | 2026-07-16T18:08:51.281Z | user Description tail link + agents machine-readable metadata line (deciqai.com/s/non-zero-sum.json) v1.0.4 | 2026-07-09T11:19:17.648Z | user R","codeSnippets":[],"executableExamples":[{"language":"text","snippet":"# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>"},{"language":"text","snippet":"# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>"},{"language":"text","snippet":"# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>"},{"language":"text","snippet":"# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>"},{"language":"text","snippet":"# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>"},{"language":"text","snippet":"# Non-Zero-Sum Analysis: <interaction>\n## Positions vs. Interests\n| Party | Stated position | Underlying interests |\n| A | <...> | <...> |\n| B | <...> | <...> |\n## Payoff Matrix\n| | B cooperates | B defects |\n| A cooperates | Both gain: <...> | A loses, B gains: <...> |\n| A defects | A gains, B loses: <...> | Both lose: <...> |\nNon-zero-sum gap: <cooperation dividend>\n## Shadow of the Future: <Strong / Moderate / Weak> — <rationale>\n## Cooperation Mechanism: <reciprocity / reputation / institution / reframing> — <rationale>\n## First Move: <action> | Defection signal: <...> | Recovery path: <...>"}],"parameters":null,"dependencies":[],"permissions":[],"extractedFiles":[{"path":"SKILL.md","content":"---\nname: non-zero-sum\ndescription: \"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past this standoff'; a negotiation or conflict feels deadlocked; you're designing a platform, contract, or institution that needs to align competing parties.\n  Do NOT activate when: the resource pool is genuinely fixed and one-shot with no side effects (true zero-sum); the conflict is identity- or values-based with no concrete trade that creates net value. More: deciqai.com/c/non-zero-sum\"\n---\n\n# Non-Zero-Sum\n\n## Overview\n\nA non-zero-sum interaction is one where mutual gain (or mutual loss) is possible — the parties' outcomes do not simply cancel each other out. Most real-world conflicts and negotiations are not zero-sum, but *feel* zero-sum because we focus on the visible resource rather than underlying interests. Robert Axelrod's computer tournament showed cooperation can emerge without central authority when interactions repeat and the future is valued. Robert Wright extended this: the arc of history is driven by accumulating non-zero-sum arrangements — specialization, trade, institutions.\n\n**Compose with neighbors:** Use prisoners-dilemma to model the payoff structure first. Use repeated-games-reputation when the key variable is whether interaction repeats. Use nash-equilibrium to find whether a stable cooperative outcome exists.\n\n## When to Use\n\n- A negotiation or conflict is deadlocked in zero-sum framing — each side treating every gain as the other's loss\n- You want to find latent cooperative value in an adversarial relationship\n- Designing an institution, platform, or contract to align incentives for competing parties\n- Someone says: *\"this is win-lose,\" \"we can't both win,\" \"what's in it for them,\" \"could we cooperate instead of compete?\"*\n- A market is framed as winner-take-all — *\"AI will take all the jobs / margin,\" \"the AI capex will only pay off for the platform,\" \"AI-native startups will crush incumbents (or vice versa)\"* — and you need to test whether the layers can grow together instead\n\n**When NOT to use:**\n- Genuinely fixed-pool, one-shot interaction with no side effects — non-zero-sum framing is wishful, not analytical\n- Interests are fundamentally incompatible (ideological, identity-based) with no concrete trade creating net value\n- The real constraint is power asymmetry → use batna-zopa instead\n\n## Coaching Novices (Adaptive Front Door)\n\n- **Engine mode:** user has a specific standoff or competitive dynamic → run The Process directly.\n- **Coach mode:** user is unfamiliar or has no concrete case → guide step by step.\n\nIn Coach mode, respond one step at a time. Each [WAIT] is a hard stop — output only that step's question, then stop.\n\n1. One-line what-it-is: non-zero-sum means both parties can gain — or both can lose — from an interaction. Most conflicts feel zero-sum but aren't.\n2. Check fit against When to Use / When NOT to use — if genuinely"},{"path":"_meta.json","content":"{\n  \"ownerId\": \"kn754b8sk22s8c6gjxt02bftbn88q7ye\",\n  \"slug\": \"non-zero-sum\",\n  \"version\": \"1.0.5\",\n  \"publishedAt\": 1784225331281\n}"},{"path":"references/sources.md","content":"# Sources — non-zero-sum\n\n> *Primary sources for the [non-zero-sum](../SKILL.md) skill.*\n\n- **Axelrod, Robert.** *The Evolution of Cooperation.* Basic Books, 1984. **Primary source for the tournament, Tit-for-Tat results, and the conditions for cooperation.** Verbatim Overview quote from ch. 1. https://www.basicbooks.com/titles/robert-axelrod/the-evolution-of-cooperation/9780465021215/\n- **Axelrod, Robert.** \"Effective Choice in the Prisoner's Dilemma.\" *Journal of Conflict Resolution* 24, no. 1 (1980): 3–25. **First academic publication of the tournament results.** https://doi.org/10.1177/002200278002400101\n- **Wright, Robert.** *Nonzero: The Logic of Human Destiny.* Pantheon, 2000. **Primary source for the historical-accumulation thesis.** Verbatim Overview quote from the Introduction. The book extends Axelrod's framework across human history, from hunter-gatherer trade to the emergence of nation-states.\n- **Rapoport, Anatol, and Chammah, Albert M.** *Prisoner's Dilemma: A Study in Conflict and Cooperation.* University of Michigan Press, 1965. **Primary source for the Prisoner's Dilemma framework** on which Axelrod's tournament is built. Documents the payoff structure and early empirical work on cooperation.\n- **Nowak, Martin A., and May, Robert M.** \"Evolutionary Games and Spatial Chaos.\" *Nature* 359 (1992): 826–829. https://doi.org/10.1038/359826a0 — Extends Axelrod's results to spatial structure, showing that cooperation can emerge and persist even when reputation and direct reciprocity are absent, through spatial clustering of cooperators.\n\n- **Microsoft.** \"Microsoft and OpenAI extend partnership.\" Official Microsoft blog, January 2023 (building on the partnership first announced in 2019). **Contemporary source for the AI-ecosystem example** — documents the multi-year, repeated cloud-plus-model partnership structure that gives the interaction a strong shadow of the future. https://blogs.microsoft.com/blog/2023/01/23/microsoftandopenaiextendpartnership/\n- **Falling AI inference cost and rising capability, 2024–2025.** Widely reported industry trend documented across successive OpenAI, Anthropic, and Google model and pricing announcements (see each provider's model release notes and API pricing pages). **Contemporary source for the \"variable-pie\" claim** in the AI-ecosystem example — lower cost-per-token expanded the set of profitable AI applications rather than merely redividing a fixed pool. Exact figures vary by model and date and are omitted where not verifiable as of early 2026.\n\n**Not cited and why:** Popular descriptions of \"win-win thinking\" as a personality trait or negotiation attitude (as in Stephen Covey's *7 Habits of Highly Effective People*) are not cited here — this skill grounds non-zero-sum analysis in payoff-structure mathematics and evolutionary stability, not in motivational or attitudinal frameworks. Covey's framing is inspirational; Axelrod's is analytical."},{"path":"examples/ai-ecosystem-value-creation-2024-2026.md","content":"# Method in Action: The AI Ecosystem — Positive-Sum vs. \"AI Eats Everything\" (2024–2026)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nThe dominant popular framing of the 2024–2026 AI boom is zero-sum: \"AI will take all the jobs,\" \"the foundation-model labs will capture all the margin,\" \"the cloud providers own everything, so app builders are just renting a commodity that will crush them.\" This example runs the skill's process over the three main layers of the AI stack — foundation-model providers (e.g., OpenAI, Anthropic, Google DeepMind), cloud/compute providers (e.g., Microsoft Azure, AWS, Google Cloud, plus the chip supplier Nvidia), and application builders (the startups and incumbents building products on top of the models) — to test whether the interaction is actually zero-sum, or whether the layers can grow together.\n\n**Step 1 — Map positions vs. underlying interests:**\n\n| Party | Stated position (\"who wins the fixed pie\") | Underlying interest |\n| Foundation-model labs | \"We own the intelligence layer; everyone above us is a thin wrapper.\" | Maximize inference demand and paying usage; need distribution to reach end users and real-world feedback to improve models. |\n| Cloud / compute providers | \"Compute is the bottleneck; we capture the rent.\" | Maximize durable, high-utilization compute consumption; need a growing population of workloads to justify enormous capex. |\n| App builders | \"We'll be commoditized the moment the labs move up-stack.\" | Ship differentiated products with proprietary data, workflow, and distribution; need cheaper, better, more reliable models. |\n\nThe *positions* are stated as a fight over one fixed pie of AI margin. The *interests* are not symmetric claims on one pool — each layer's interest is served by the *others' growth*: labs need distribution (app builders) and compute (cloud); cloud needs workloads (both); app builders need cheaper, better models (labs) running on reliable infrastructure (cloud).\n\n**Step 2 — Construct the payoff matrix:**\n\nReduce to two representative players — the model/compute *platform* layer and the *app-builder* layer — and ask whether total value is fixed or variable.\n\n| | App builders invest / build on the platform | App builders retreat / hedge away |\n| **Platform invests in capability + access** | Both gain: cheaper, more capable models expand what apps can profitably do → more usage → more inference revenue and compute consumption. New categories (coding assistants, customer support, document workflows) become viable that did not exist before. | Platform loses: capex is stranded, utilization drops. Builders lose the capability they were waiting for. |\n| **Platform extracts / locks in aggressively** | Builders lose margin and autonomy; platform gains short-term rent but starves the ecosystem that generates demand and feedback. | Both lose: builders route around the platform (open-weight models, multi-vendor abstraction), platform's demand shrinks, the category's growth sta"},{"path":"examples/axelrods-computer-tournament-1980.md","content":"# Method in Action: Axelrod's Computer Tournament (1980)\n\n> *Example for the [non-zero-sum](../SKILL.md) skill.*\n\nPrimary-source-documented case. Axelrod ran the first computer Prisoner's Dilemma tournament in 1980, inviting submissions from specialists in game theory across multiple disciplines. He ran a second tournament in 1981 with 62 entries. Both are fully documented in *The Evolution of Cooperation* (1984).\n\n**Step 1 — Positions vs. interests:**\nIn the Prisoner's Dilemma (as in most real strategic interactions), the *position* of each player is \"defect if the other defects, cooperate only if cooperation is guaranteed.\" The *interest* of each player is to maximize total accumulated payoff over repeated interactions. These are not the same.\n\n**Step 2 — Payoff matrix:**\nMutual cooperation: both players receive R (reward). Mutual defection: both receive P (punishment, worse than R). Temptation: one defects while the other cooperates — defector receives T (temptation, highest single-round payoff); cooperator receives S (sucker's payoff, lowest). The standard ordering: T > R > P > S. The non-zero-sum gap: if both cooperate repeatedly (R per round) vs. if both defect repeatedly (P per round), the cooperation stream produces more total value. The gap is the non-zero-sum dividend.\n\n**Step 3 — Shadow of the future:**\nThe tournament was designed as iterated (indefinitely repeated) interactions. Axelrod showed mathematically that the minimum condition for Tit-for-Tat to be the stable strategy is: the discount factor (how much each player values future payoffs) must exceed (T − R) / (T − P). When interactions are repeated and future payoffs are valued, defection becomes irrational even for purely self-interested players.\n\n**Step 4 — Cooperation mechanism:**\nDirect reciprocity (Tit-for-Tat) was the winning mechanism in both tournaments. Tit-for-Tat's structural properties: (a) it starts cooperating (not exploitable through pre-emptive defection); (b) it retaliates immediately (defectors receive P immediately, not with delay); (c) it forgives after one retaliation (the relationship can recover, unlike strategies that defect forever after one betrayal). These properties map precisely to what makes cooperation self-sustaining.\n\n**Step 5 — First move:**\nAxelrod's result: the optimal first move is unconditional cooperation, combined with credible and immediate retaliation capability. Strategies that started defecting never recovered: they generated defection spirals that left both parties worse off than the mutual cooperation equilibrium.\n\n**What the tournament shows:** Cooperation can emerge and be sustained in non-zero-sum repeated interactions *without* any central authority, enforcement mechanism, or moral instruction. The self-sustaining mechanism is the payoff structure itself, combined with a sufficiently strong shadow of the future. The implication for institutional design: if you want cooperation, ensure the interaction is repeated, make defection i"}],"languages":[],"docsSourceLabel":"CLAWHUB","editorialOverview":"Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past thi... Skill: Non-Zero-Sum Owner: deciqai Summary: Activate when: someone says 'this is win-lose,' 'we can't both win,' 'what's in it for them to cooperate,' 'is there a deal here,' or 'how do we get past thi... Tags: latest:1.0.5 Version history: v1.0.5 | 2026-07-16T18:08:51.281Z | user Description tail link + agents machine-readable metadata line (deciqai.com/s/non-zero-sum.json) v1.0.4 | 2026-07-09T11:19:17.648Z | user R","editorialQuality":{"score":100,"threshold":65,"status":"ready","wordCount":2187,"uniquenessScore":47,"reasons":[]}},"media":{"evidence":{"source":"no-media","verified":false,"confidence":"low","updatedAt":"2026-10-11T10:45:24.161Z","emptyReason":"No screenshots, media assets, or demo links are available."},"primaryImageUrl":null,"mediaAssetCount":0,"assets":[],"demoUrl":null},"ownerResources":{"evidence":{"source":"unclaimed","verified":false,"confidence":"low","updatedAt":"2026-10-11T10:45:24.161Z","emptyReason":"This page has not been claimed by the agent owner."},"hasCustomPage":false,"customPageUpdatedAt":null,"customLinks":[],"structuredLinks":{"docsUrl":null,"demoUrl":null,"supportUrl":null,"pricingUrl":null,"statusUrl":null},"customPage":null},"relatedAgents":{"evidence":{"source":"protocol-neighbors","verified":false,"confidence":"medium","updatedAt":"2026-10-11T14:13:45.420Z","emptyReason":null},"items":[{"id":"8ebccd8e-3863-4187-8355-c3f14e1f9edf","entityType":"agent","canonicalPath":"/agent/iofficeai-aionui","slug":"iofficeai-aionui","name":"AionUi","description":"Free, local, open-source 24/7 Cowork app and OpenClaw for Gemini CLI, Claude Code, Codex, OpenCode, Qwen Code, Goose CLI, Auggie, and more | 🌟 Star if you like it!","url":"https://github.com/iOfficeAI/AionUi","homepage":"https://www.aionui.com","source":"GITHUB_REPOS","protocols":["MCP","OPENCLAW"],"capabilities":[],"safetyScore":100,"overallRank":70,"updatedAt":"2026-10-09T19:11:12.944Z","createdAt":"2026-02-25T03:38:16.584Z","downloads":null},{"id":"b917f68a-ebff-438e-84f8-3f4b2494c0bc","entityType":"agent","canonicalPath":"/agent/activepieces-activepieces","slug":"activepieces-activepieces","name":"activepieces","description":"AI Agents & MCPs & AI Workflow Automation • (~400 MCP servers for AI agents) • AI Automation / AI Agent with MCPs • AI Workflows & AI Agents • MCPs for AI Agents","url":"https://github.com/activepieces/activepieces","homepage":"https://www.activepieces.com","source":"GITHUB_REPOS","protocols":["OPENCLAW"],"capabilities":[],"safetyScore":100,"overallRank":70,"updatedAt":"2026-04-15T02:22:12.426Z","createdAt":"2026-02-25T03:38:12.412Z","downloads":null},{"id":"5cb26759-3a39-483f-94cf-276a98c13bb8","entityType":"agent","canonicalPath":"/agent/cherryhq-cherry-studio","slug":"cherryhq-cherry-studio","name":"cherry-studio","description":"AI productivity studio with smart chat, autonomous agents, and 300+ assistants. Unified access to frontier LLMs","url":"https://github.com/CherryHQ/cherry-studio","homepage":"https://cherry-ai.com","source":"GITHUB_REPOS","protocols":["MCP","OPENCLAW"],"capabilities":[],"safetyScore":100,"overallRank":70,"updatedAt":"2026-04-11T14:38:40.986Z","createdAt":"2026-02-25T03:38:19.379Z","downloads":null},{"id":"6f6582d0-5d76-4f0f-b81d-86520247950b","entityType":"agent","canonicalPath":"/agent/copilotkit-copilotkit","slug":"copilotkit-copilotkit","name":"CopilotKit","description":"The Frontend for Agents & Generative UI. React + Angular","url":"https://github.com/CopilotKit/CopilotKit","homepage":"https://docs.copilotkit.ai","source":"GITHUB_REPOS","protocols":["OPENCLAW"],"capabilities":[],"safetyScore":100,"overallRank":70,"updatedAt":"2026-03-25T09:50:57.846Z","createdAt":"2026-02-25T03:39:14.617Z","downloads":null}],"links":{"hub":"/agent","source":"/agent/source/clawhub","protocols":[{"label":"OpenClaw","href":"/agent/protocol/openclew"}]}}}