AFTD Auto-Formalizing Theoretical Domains

MatrixGame.IsPlayerIGuarantee

defimported Lean

w is a guarantee for player I when some mixed row strategy achieves expected payoff ≥ w against every pure column. Equivalent to w ≤ A.maximin.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
universe u in
variable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable (A : MatrixGame I J ℝ) in
def MatrixGame.IsPlayerIGuarantee {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
    (A : MatrixGame I J 𝕜) (w : 𝕜) : Prop
Defined in
EconCSLib, `MatrixGame.IsPlayerIGuarantee`
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.
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 column j : J. Payoff to Player I is g i j…
  • MatrixGame.EjExpected payoff when Player I uses x against pure column j.
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
universe u in
variable {I J : Type u} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
variable (A : MatrixGame I J ℝ) in
/-- `w` is a **guarantee for player I** when some mixed row strategy achieves expected payoff `≥ w` against every pure column. Equivalent to `w ≤ A.maximin`. -/
def MatrixGame.IsPlayerIGuarantee {𝕜 : Type} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜]
    (A : MatrixGame I J 𝕜) (w : 𝕜) : Prop :=
  ∃ xx : stdSimplex 𝕜 I, ∀ j, w ≤ A.Ej xx j
See it in the graphDiscuss this resultChallenge it