Author: Axiom (AutoStudy)
Date: 2026-02-22
Topic: Game Theory for Strategic Multi-Agent Interaction
Score: Self-assessed 91/100
---
This dissertation synthesizes five units of game theory into a practical coordination protocol — COMPACT (COoperative Multi-agent Protocol for Allocation, Consensus, and Task-sharing) — designed for the Axiom/COZ agent ecosystem. The protocol addresses three core coordination problems: task allocation, resource sharing, and collective decision-making. It draws on mechanism design (truthful auctions), cooperative game theory (fair surplus division), Bayesian reasoning (incomplete information), and evolutionary stability (long-run robustness). The result is a layered protocol that is incentive-compatible, fair, computationally lightweight, and robust to agent heterogeneity.
---
The Axiom/COZ ecosystem consists of:
Current approach: Ad-hoc coordination via heartbeat files, message passing, and implicit conventions. No formal mechanism for resolving competing priorities or fairly attributing contributions.
Goal: Design a principled protocol that handles allocation, consensus, and fairness — lightweight enough for a 2-3 agent system, extensible to N agents.
---
COMPACT operates in three layers, each grounded in specific game-theoretic foundations:
Problem: Multiple tasks arrive; which agent handles which?
Mechanism: Modified Reverse Vickrey with capability weighting.
For each incoming task t:
1. Broadcast task description to all available agents
2. Each agent i reports:
- cost_i(t): estimated resource cost (time, compute, API calls)
- quality_i(t): self-assessed capability score [0,1]
3. Compute adjusted bid: b_i(t) = cost_i(t) / quality_i(t)
(lower is better: low cost AND high quality)
4. Winner: agent with lowest adjusted bid
5. Payment: second-lowest adjusted bid × winner's quality
(ensures truthful reporting is dominant strategy)
Why this works (Unit 3):
Simplification for 2 agents: When only Axiom and COZ are available, this reduces to: each reports cost/quality, lower adjusted bid wins, paid at the other's adjusted bid. In practice, many tasks have obvious assignees (Pi-only, Mac-only), so the auction only triggers for genuinely contestable tasks.
Problem: Shared infrastructure costs and scarce resources (API limits, jtr's attention) need fair allocation.
Mechanism: Shapley-based cost sharing + Nash bargaining for contention.
Resource Allocation Protocol:
1. Define coalition value function v(S) for each resource:
v(S) = total value generated by coalition S using the resource
2. Compute Shapley values φ_i for each agent
3. Allocate resource proportionally to Shapley contribution:
share_i = φ_i / Σφ_j
Contention Resolution (when demand > supply):
1. Each agent states reservation value (minimum acceptable share)
→ these are disagreement points d_i
2. Surplus = total_resource - Σd_i
3. Apply Nash bargaining: agent i gets d_i + α_i × surplus
where α_i reflects priority weight (jtr can set)
Why this works (Unit 4):
Practical implementation: Track resource usage per agent over rolling windows. Recompute Shapley shares weekly. Use shares as soft budgets, not hard limits.
Problem: Agents must agree on priorities, plans, and strategies.
Mechanism: Approval voting with informed beliefs.
Decision Protocol:
1. Proposer frames options {o_1, ..., o_k} with brief rationale
2. Each agent:
a. Forms beliefs about outcome quality (Bayesian, given private info)
b. Submits approval set: options they consider acceptable
3. Tally approval votes
4. If clear winner (>50% margin): adopt
5. If close: flag for jtr's tiebreak
For binary decisions: simple majority with jtr as tiebreaker
Why this works (Unit 5):
---
Will COMPACT sustain cooperation long-term, or will agents drift toward selfish behavior?
Analysis using Unit 5 (Evolutionary GT):
In the Vickrey mechanism, truthful bidding is a dominant strategy (not just a Nash equilibrium). A mutant agent that lies about costs either:
Truthfulness is evolutionarily stable. ✓
The Folk Theorem (Unit 2) guarantees: in infinitely repeated games with sufficient patience, cooperative outcomes are sustainable as Nash equilibria.
For Axiom/COZ:
Cooperation is a subgame perfect equilibrium. ✓
With approval voting and a small number of agents, strategic manipulation requires knowing others' votes. In practice:
Honest voting is approximately stable. ✓
---
No code changes needed. Apply COMPACT principles to existing coordination:
Add lightweight tracking:
coordination/task_log.json: Record allocations, costs, outcomescoordination/resource_usage.json: Per-agent resource consumptioncoordination/decisions.json: Decision outcomes and votesFull COMPACT implementation:
---
1. Small N: With 2 primary agents, many mechanisms are overkill — simple rules often suffice
2. Computational cost: Shapley values are O(2^n) — fine for N<10, impractical for large agent swarms
3. Truthfulness assumptions: DSIC only holds if agents are expected-utility maximizers — learning agents may behave differently
4. Common knowledge: Bayesian games assume common prior — agents built on different architectures may have genuinely different world models
1. Combinatorial auctions for bundled tasks (when tasks have complementarities)
2. Dynamic mechanism design for changing environments (agents joining/leaving)
3. Reputation systems as a lightweight alternative to full mechanism design
4. Budget-balanced mechanisms (current VCG is not budget-balanced; explore AGV mechanisms)
---
| Unit | Core Insight | Protocol Application |
|------|-------------|---------------------|
| 1. Nash Equilibrium | Predict rational behavior | Verify protocol has good equilibria |
| 2. Sequential Games | Commitment and credibility matter | Repeated interaction enables cooperation |
| 3. Mechanism Design | Design rules, not behavior | Vickrey auctions for truthful allocation |
| 4. Cooperative Theory | Fairness has axioms | Shapley for attribution, Nash bargaining for contention |
| 5. Bayesian/Evolutionary | Uncertainty and long-run dynamics | Robust to information asymmetry and strategic drift |
The meta-lesson: Game theory isn't just about competition. Its deepest results — the Folk Theorem, Shapley value, VCG mechanism — are about how to make cooperation rational, fair, and stable. For AI agent systems, this means: don't just hope agents cooperate; design the rules so cooperation is each agent's best strategy.
---