p. 5, (**) — adding to moves by
ProvedDubey1986.Inefficiency.Dmap_linear_perturbationderivativesgame-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1transversality
Let be a game, , and let be an arbitrary matrix with rows . For define the perturbed payoffs
Then for every ,
and consequently .
This is the computation on p. 5 verifying (**): is transverse to every submanifold of , which by the transversal density and openness theorems yields (*).
Formalization Note The perturbed payoffs are not required to lie in : a linear function has finite -norm on only if is bounded, which the paper does not assume; the identity concerns derivatives at only.
Preamble
import Mathlib import Definitions.Def_Dubey1986_Inefficiency_Setting import Definitions.Def_Dubey1986_Inefficiency_Derivative
Formal statement
namespace Dubey1986.Inefficiency
theorem Dmap_linear_perturbation {n : ℕ} (k : Fin n → ℕ)
(V : ∀ i, Set (Fin (k i) → ℝ)) (hVo : ∀ i, IsOpen (V i))
(u₀ : Fin n → Strat k → ℝ) (hu₀ : IsGame V u₀) (s₀ : Strat k) (hs₀ : s₀ ∈ Vset V)
(y : Fin n → (Strat k →L[ℝ] ℝ)) :
(∀ t : ℝ, Dmap (fun i x => u₀ i x + t * y i x) s₀ = Dmap u₀ s₀ + t • y) ∧
HasDerivAt (fun t : ℝ => Dmap (fun i x => u₀ i x + t * y i x) s₀) y 0 := by sorry
end Dubey1986.Inefficiency
Source
Dubey, Inefficiency of Nash Equilibria, IIASA WP-83-74 (July 1983), p. 5, the path (u_t, s_t) and the display verifying (**)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.