Proposition 3.17 — existence and uniqueness under condition (17)
ProvedGraphonGames.Stability.proposition_3_17_unique_equilibriumcontractiongraphon-gamenash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Assume Assumptions 1 and 4. Let be a graphon with operator such that and
Then the graphon game has a Nash equilibrium, and every Nash equilibrium is equal to it almost everywhere.
This gives the unique equilibrium named in the stability theorem.
Formalization Note Equilibrium uses the pointwise minimization condition of Proposition 3.6 and carries an aggregate satisfying (6). Uniqueness is of classes; no boundedness Assumption 5 is imposed.
Preamble
import Mathlib import Definitions.Def_GraphonGames_Stability_Setting open MeasureTheory
Formal statement
namespace GraphonGames.Stability
theorem proposition_3_17_unique_equilibrium
(b : ℝ → ℝ → ℝ) (f : ℝ → ℝ → ℝ → ℝ)
(μ0 : Measure ℝ) (cα cz ℓc ℓJ : ℝ)
(h1 : GraphonGames.Existence.Asm1 b μ0 cα cz)
(h4 : GraphonGames.Existence.Asm4 (GraphonGames.Existence.cost b f μ0) ℓc ℓJ)
(w : I → I → ℝ) (hw : IsGraphon w)
(hW : Real.sqrt cz * (opNorm w).toReal < 1)
(h17 : ℓJ / ℓc *
(Real.sqrt cα * (opNorm w).toReal /
(1 - Real.sqrt cz * (opNorm w).toReal)) < 1) :
∃ α, IsNash w b f μ0 α ∧
∀ α', IsNash w b f μ0 α' → α' =ᵐ[volume] α := by sorry
end GraphonGames.Stability
Source
Carmona, Cooney, Graves & Laurière, Stochastic Graphon Games: I. The Static Case, arXiv:1911.10664v1, p. 15, Proposition 3.17 and (17)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.