Game Theory in MARIA OS
Why coupled agents converge instead of oscillate. Nash equilibrium, blocking coalitions, and mechanism design translated into responsibility gates and escalation design.
Agent organizations are coupled utility systems
The MARIA OS problem is not merely who is correct. It is whether each actor can pursue its own utility without making the organization diverge. Because every agent best-responds to the roles and constraints of others, the whole system must be treated as a game.
Planner
Maximizes exploration and speed
Can overrun constraints if left unchecked
Architect
Maximizes boundaries and replayability
Can reduce throughput if it hardens too much
Operator
Maximizes field results and recoverability
Local wins can damage the global system
Each player chooses a role r_i and maximizes utility under the current role assignment ρ_t and governance density D_t.
Key Point
Workflows only define order. Game theory explains what happens when multiple optimizers collide. MARIA OS matters because coordination cannot depend on goodwill alone.
Governance does not merely persuade behavior. It reshapes the payoff landscape.
A MARIA OS gate is not a checklist added after the fact. It is mechanism design: unsafe choices receive penalties and safe coordination becomes strategically superior. The matrices below show that shift in the smallest possible two-player game.
Ungoverned Game
Base game with only short-term utility
Fast but unstable. Dangerous equilibrium.
Architect protects the system, but friction is high.
Planner wins locally while boundaries erode.
Safer, but weak against short-term incentives.
Each cell is a payoff pair (Planner, Architect). The important part is not the absolute number, but how gate design changes which cell becomes equilibrium.
Governed Game
Game after adding gate penalty λ
High risk destroys the short-term gain.
One-sided caution does not produce stable throughput.
Evidence alone is not enough without structural gating.
Evidence-first becomes the stable equilibrium.
Each cell is a payoff pair (Planner, Architect). The important part is not the absolute number, but how gate design changes which cell becomes equilibrium.
If gate penalty λ exceeds the unilateral short-term deviation gain Δ_short-term, the evidence-first / tight-gate profile becomes a Nash equilibrium.
Nash (1950): equilibrium existence.
Mechanism design: redesign payoffs so desirable equilibria emerge.
MARIA OS: GateScore and escalation perform that payoff surgery.
This state becomes that state
The key is not persuading agent personalities. It is replacing the attractor of the game. MARIA OS uses gates and escalation to make the unsafe short-term equilibrium unattractive and the evidence-first equilibrium dominant.
Before Governance
Short-term utility attracts the unsafe equilibrium
Both players gain in the short term, so an unsafe profile can become equilibrium.
The Architect protects the system, but the Planner still has incentive to deviate.
Evidence helps, but weak gating leaves an unsafe shortcut in the game.
Safer, but too weak against short-term payoff pressure.
After Governance
The safe equilibrium becomes the attractor
Gate penalties erase the unsafe short-term gain, so this profile stops being attractive.
One-sided caution still fails to balance throughput and legitimacy.
Evidence-first is not enough if the gate remains structurally weak.
Evidence-first plus tight gating becomes the desirable stable equilibrium.
Local speed wins, so the unsafe short-term equilibrium is selected.
GateScore and escalation make the evidence-first equilibrium strategically preferred.
Stable specialization can be defined as a fixed point
A Nash equilibrium is a state where no agent has incentive to change roles unilaterally. In MARIA OS this becomes a fixed point of the role assignment vector. Governance density must be high enough relative to interaction strength so the equilibrium converges instead of oscillating.
The simultaneous map where every agent recomputes its best role.
If the interaction strength λ_max is dominated by governance density D_t, cycling is replaced by stable specialization.
Equilibrium is not inactivity. It is a dynamic balance in which no one needs to switch roles under the current boundaries and incentives.
If the role-change magnitude shrinks each iteration, the team is approaching equilibrium. If it amplifies, governance is too weak.
Compute best responses
Each agent chooses the role that maximizes utility given the current roles of everyone else.
Search for a fixed point
A role assignment ρ* is a Nash equilibrium when no single agent can improve by deviating alone.
Impose a convergence condition
When the spectral radius of interaction stays below governance damping, the equilibrium becomes stable.
If the equilibrium is wrong, change the game itself
An equilibrium can exist and still be unacceptable for company values or audit constraints. MARIA OS overlays gates, evidence requirements, and escalation rules on top of local payoffs so undesirable equilibria become non-executable.
Peer negotiation
Local conflicts are resolved at the same layer first. If they fail, the disagreement is preserved and escalated.
Universe gate
GateScore and responsibility boundaries change the payoff itself, not just the message between agents.
Human escalation
Even if an equilibrium exists, humans intervene when that equilibrium is unacceptable for the organization.
A blocking coalition is a coordination pattern that is attractive to a subset of players but dangerous for the organization. MARIA OS detects it through responsibility gates and prioritizes system safety over local payoff.
Game theory becomes runtime structure
The value of this page is not to add more theory vocabulary. It is to map strategy spaces, equilibria, and mechanism design into concrete runtime artifacts: candidate generation, GateScore, and responsibility escalation.
Game theory does not stand alone. It becomes operational only when combined with stability proofs, quality gates, and team design.