AFTD Auto-Formalizing Theoretical Domains

agSub

def

Count vector seen by a player on strategy i when the totals are c.

Statement

def agSub {s : ℕ} (c : Fin s → ℕ) (i : Fin s) : Fin s → ℕ
Source
step towards ag_two_exact / ag_three_lower / ag_four_lower (Computing Equilibria in Anonymous Games, FOCS 2007 (arXiv:0710.5582), concluding conjecture that s*lambda is a lower bound)
Verified
06 Oct 2026
Axioms
none listed
Used by 3
  • agCyc_regretFrom a regret-2 certificate on the totals to a player with regret 1/2.
  • agCyc4_checkFinite check for four strategies and five players.
  • agCyc3_checkFinite check for three strategies and five players (totals a + b + d = 5).

Lean source view module on GitHub

/-- Count vector seen by a player on strategy `i` when the totals are `c`. -/
def agSub {s : ℕ} (c : Fin s → ℕ) (i : Fin s) : Fin s → ℕ := fun k => c k - if k = i then 1 else 0
See it in the graphDiscuss this resultChallenge it