MatrixGame.guarantee_I
defimported Lean
Player I's guaranteed payoff using mixed strategy x: the minimum expected payoff over all of Player II's pure responses. A finite Finset.inf' over J, so only [LinearOrder ๐] is needed โ no order completeness.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Matrix in variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in variable {๐ : Type} [Field ๐] [LinearOrder ๐] [IsStrictOrderedRing ๐] in variable (A : MatrixGame I J ๐) in noncomputable def MatrixGame.guarantee_I (x : stdSimplex ๐ I) : ๐
- Defined in
- EconCSLib, `MatrixGame.guarantee_I`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.MatrixGame.guarantee_I← MatrixGame.guarantee_I (EconCSLib/GameTheory/StrategicGame/ZeroSum/MatrixGame.lean:107): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- MatrixGameA finite two-player zero-sum matrix game. Player I chooses row
i : I, Player II chooses columnj : J. Payoff to Player I isg i jโฆ - MatrixGame.EjExpected payoff when Player I uses
xagainst pure columnj.
- MatrixGameA finite two-player zero-sum matrix game. Player I chooses row
- Used by 10
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs โ saddle points. A pair of mixed strategies is in the product
X(A) ร Y(A)of optimal strategy sets iff it is a saddleโฆ - MatrixGame.dualityGapPoint-wise duality gap at a strategy pair: the column player's realised loss-cap minus the row player's realised guarantee. Alwaysโฆ
- MatrixGame.optimalRowStrategiesThe set of optimal row strategies: mixed strategies that achieve the maximin value.
- MatrixGame.common_guarantee_eq_valueCommon guarantee gives the value. If both players guarantee the same scalar
w, thenwequals the game value. - MatrixGame.optimalRowSet_nonemptyMatrixGame.optimalRowSet_nonempty
- MatrixGame.maximinThe maximin value: the best guarantee Player I can achieve.
maximin = sup_x inf_j E(x, j) - MatrixGame.IsEpsilonOptimalRowAn ฮต-optimal row strategy guarantees at least
value - ฮต. - MatrixGame.mem_optimalRowStrategies_iff_E_geA row strategy is optimal iff against every mixed column it secures the value.
- saddle_gap_marginal_payoff_boundsLet n be a positive natural number. For any matrix A : Matrix (Fin n) (Fin n) โ with non-negative entries and any optimal row strategy ฯโฆ
- MatrixGame.optimalColumnSet_nonemptyMatrixGame.optimalColumnSet_nonempty
- MatrixGame.optimal_pairs_iff_saddle_pointOptimal pairs โ saddle points. A pair of mixed strategies is in the product
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Matrix in variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in variable {๐ : Type} [Field ๐] [LinearOrder ๐] [IsStrictOrderedRing ๐] in variable (A : MatrixGame I J ๐) in /-- Player I's guaranteed payoff using mixed strategy `x`: the minimum expected payoff over all of Player II's pure responses. A finite `Finset.inf'` over `J`, so only `[LinearOrder ๐]` is needed โ no order completeness. -/ noncomputable def MatrixGame.guarantee_I (x : stdSimplex ๐ I) : ๐ := Finset.inf' univ Finset.univ_nonempty (fun j => A.Ej x j)