§III, p. 1833 and fn. 14 — every game of 𝒰₀ has the unique Nash equilibrium x̄ⁱ(Γ) = a^{i−1}/(a^{i−1}+1)
ProvedUncoupledDyn.Finite.jordan_unique_nashLet with for every , and let be the game of Jordan's family with parameters (player gets for playing against the next player's , gets for playing against the next player's , and otherwise). Then has exactly one Nash equilibrium in mixed strategies, namely
with indices taken modulo 3 (so ). In particular, Jordan's game ( for all ) has the unique Nash equilibrium .
This is the single-Nash-equilibrium property of the family , on which the §III proof of Theorem 1 rests: it identifies the rest point of every Nash-convergent dynamic at every game of the family.
Formalization Note. The page takes all close to (" for some small "); the statement here assumes only , which contains every such family with and is all that fn. 14's argument uses. Players are 0-based, so the formula reads x i = a (i - 1) / (a (i - 1) + 1) with subtraction in Fin 3 (wrapping ).
import Mathlib import Definitions.Def_FatkhullinPolyak_Discrete_Matrix import Definitions.Def_UncoupledDyn_Finite_Setting
namespace UncoupledDyn.Finite
theorem jordan_unique_nash (a : Fin 3 → ℝ) (ha : ∀ i, 0 < a i) :
(∀ x : Fin 3 → ℝ, IsNash (jordanGame a) x ↔ x = fun i => a (i - 1) / (a (i - 1) + 1)) ∧
(∀ x : Fin 3 → ℝ, IsNash Gamma0 x ↔ x = fun _ => (1 / 2 : ℝ)) := by sorry
end UncoupledDyn.Finite
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.