(17:E) — specially strictly determined iff both players have a pure good strategy
ProvedTheoryOfGames.Minimax.speciallyStrictlyDetermined_iff_pure_goodgame-theorymixed-strategiesp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1strictly-determinedzero-sum-games
Let be the matrix of a normalized zero-sum two-person game with and pure strategies. The game is specially strictly determined, i.e.
if and only if there exists for each player a good strategy which is a pure strategy: some coordinate vector belongs to and some coordinate vector belongs to .
The result ties the pure-strategy notion of strict determinateness of §14 to the mixed-strategy solution of §17.
Formalization Note is pureVec τ, the vector with a in coordinate and elsewhere; pure strategies are indexed from .
Preamble
import Mathlib import Definitions.Def_TheoryOfGames_Minimax_MixedStrategy
Formal statement
namespace TheoryOfGames.Minimax
/-- (17:E), p. 161: a normalized zero-sum two-person game with `β₁, β₂ ≥ 1` pure strategies is
specially strictly determined (`v₁ = v₂`, 17.5.1) if and only if each player has a good
strategy which is a pure strategy: some `δ^{τ₁}` belongs to `Ā` and some `δ^{τ₂}` belongs
to `B̄`. -/
theorem speciallyStrictlyDetermined_iff_pure_good {β₁ β₂ : ℕ} (hβ₁ : 0 < β₁) (hβ₂ : 0 < β₂)
(H : Fin β₁ → Fin β₂ → ℝ) :
SpeciallyStrictlyDetermined H ↔
(∃ τ₁ : Fin β₁, pureVec τ₁ ∈ goodA H) ∧ (∃ τ₂ : Fin β₂, pureVec τ₂ ∈ goodB H) := by sorry
end TheoryOfGames.Minimax
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 161, (17:E); definition of special strict determinateness p. 150, 17.5.1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.