p. 6, ¶1 — if is transverse to , then and the interior Nash equilibria are finite
ProvedDubey1986.Inefficiency.finite_of_transversefinitenessgame-theorynash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1transversality
Let , , let be open, let be compact with , , and let be a game such that is transverse to at every point of . Then
- the set is finite;
- the set of Nash equilibria of with every in the interior of is finite.
Since , transversality makes discrete, and its intersection with the compact is finite; by (i) the interior Nash equilibria lie in it.
Formalization Note The paper writes "By (i), "; (i) was established for interior points only, so part 2 is stated for the interior Nash equilibria, which is the case under consideration at that point of the proof.
Preamble
import Mathlib import Definitions.Def_Dubey1986_Inefficiency_Setting import Definitions.Def_Dubey1986_Inefficiency_Derivative
Formal statement
namespace Dubey1986.Inefficiency
theorem finite_of_transverse {n : ℕ} (hn : 2 ≤ n) (k : Fin n → ℕ) (hk : ∀ i, 1 ≤ k i)
(V : ∀ i, Set (Fin (k i) → ℝ)) (hVo : ∀ i, IsOpen (V i))
(hSV : ∀ i, simplex (k i) ⊆ V i) (W : ∀ i, Set (Fin (k i) → ℝ))
(hWc : ∀ i, IsCompact (W i)) (hSW : ∀ i, simplex (k i) ⊆ interior (W i))
(hWV : ∀ i, W i ⊆ V i) (u : Fin n → Strat k → ℝ) (hu : IsGame V u)
(htr : ∀ x ∈ Set.univ.pi W, TransverseAt (Dmap u) (Nstar k) x) :
(S k ∩ Dmap u ⁻¹' (Nstar k : Set (Fin n → (Strat k →L[ℝ] ℝ)))).Finite ∧
{s | s ∈ NashSet u ∧ ∀ i, s i ∈ interior (simplex (k i))}.Finite := by sorry
end Dubey1986.Inefficiency
Source
Dubey, Inefficiency of Nash Equilibria, IIASA WP-83-74 (July 1983), p. 6, first paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.