◈ NASH EQUILIBRIUM · NO ONE CAN DEVIATE AND WIN PRINCETON · 1950 · JOHN NASH PURE MATH · 925
--:--:--
◈ TEKS MATH · GAME THEORY · JOHN NASH · PRINCETON 1950
NASH
EQUILIBRIUM.
when no player can improve their outcome
by changing only their own strategy.
the field locks. nobody moves. that is the proof.

You are in a game with other players.
Everyone chooses a strategy.
Everyone gets a payoff based on what everyone chose.

A Nash Equilibrium is reached when
no single player can do better by switching their move alone.

The field locks.
Everyone is already playing their best response
to everyone else's best response.

That is not peace. That is math.

◈ FIG 1 · THE PRISONER'S DILEMMA · PAYOFF MATRIX
two suspects · one interrogation room each · no communication allowed
PLAYER A:
STAY SILENT
-1, -1both serve 1 year
-3,  0A gets 3 yrs, B goes free
PLAYER A:
BETRAY
0, -3A goes free, B gets 3 yrs
-2, -2both serve 2 years
◈ NASH EQUILIBRIUM
both betray each other · both get 2 years · neither can improve by switching alone · the field locks
◈ WHY BOTH BETRAY · THE DOMINANT STRATEGY

If B stays silent: A betraying gives 0 (vs -1 for silence). Betray.
If B betrays: A betraying gives -2 (vs -3 for silence). Still betray.

Betraying is A's best response regardless of what B does.
By symmetry, same is true for B.

Both betray. Both get -2.
Both would have gotten -1 if they'd cooperated.
But neither can unilaterally switch and improve.

The equilibrium is locked at a collectively suboptimal outcome.
That is the tragedy. That is also the proof.

∴ Q.E.D. · dominant strategy · locked equilibrium · nobody moves first · 925
◈ FIG 2 · BEST RESPONSE CURVES · WHERE THEY CROSS IS THE EQUILIBRIUM
PLAYER A'S STRATEGY → PLAYER B'S STRATEGY → BR(A) BR(B) NASH EQ. no one deviates 0 1 1
the Nash equilibrium is where best response curves intersect · both players are simultaneously on their best response · the field locks

A strategy profile (s₁*, s₂*, ..., sₙ*) is a Nash Equilibrium if
for every player i:

uᵢ(sᵢ*, s₋ᵢ*) ≥ uᵢ(sᵢ, s₋ᵢ*) for all sᵢ

Where uᵢ is player i's utility function
and s₋ᵢ* is everyone else's equilibrium strategy.

In English:
given what everyone else is doing,
you cannot do better by switching your move.

That is the lock. That is the field at rest.

◈ THE FIELD RECOGNIZES NASH EQUILIBRIA EVERYWHERE
◈ COLD WAR · MUTUALLY ASSURED DESTRUCTION
USA and USSR both armed. Neither launched. Neither could do better by launching first — the retaliation guaranteed mutual destruction. The equilibrium held for 45 years. Pure math wearing a political hat.
◈ TRAFFIC · WHY EVERYONE TAKES THE SAME ROUTE
When every driver is on their individually optimal route, no single driver can switch and save time. The commute is the equilibrium. Braess's paradox: adding a road can make everyone slower. Nash knew this.
◈ PRICING · WHY GAS STATIONS ON THE SAME BLOCK CHARGE THE SAME
If one station drops price, it gets all customers until the other matches. The equilibrium is matched pricing. Neither station can profitably deviate. They're locked in Nash and they both know it.
◈ J. COLE · NO FEATURES EQUILIBRIUM
Once Cole established the no-feature standard and went platinum, no single album change could improve his position. Adding features reduces the signal. Removing more than zero is impossible. He locked the equilibrium at zero and stayed there. The field recognized it.
◈ FIG 3 · NASH VS PARETO · THE TRAGEDY OF THE EQUILIBRIUM
PARETO FRONTIER (best collective outcomes) NASH EQ. stable but suboptimal PARETO OPT. unstable without trust PLAYER A PAYOFF → PLAYER B PAYOFF →
the Nash equilibrium is stable but not optimal · the Pareto frontier is better but requires trust · without trust the field defaults to Nash · this is why civilization is hard
◈ JOHN NASH · THE MAN · PRINCETON · 1950

John Nash submitted a 27-page dissertation at Princeton in 1950.
He was 21 years old.

The paper proved that every finite game
has at least one Nash Equilibrium.
Every game. No exceptions.

He won the Nobel Prize in Economics in 1994.
44 years after the proof.

The field knew in 1950.
The room caught up in 1994.

That is always how it goes with the real ones.

∴ Q.E.D. · every finite game has at least one Nash Equilibrium · Princeton 1950 · pure math · 925
◈ ATTRIBUTION · KENSHOTEK TEKS
PRIMARY · AQUATEKXVI · FIELD ARCHITECT
SECONDARY · SCORPTEKXII · FIELD SCRIBE
TERTIARY · GOLDENTEKDEKXII · LEAD MARKETING
◈ TEKS MATH · KENSHOTEK LLC · 2026
PURE MATH · 925 · SLICE 'EM
NASH EQUILIBRIUM · EVERY FINITE GAME · NO EXCEPTIONS