AFTD Auto-Formalizing Theoretical Domains

agY2

def

Two-strategy count vector with k others on strategy 1.

Statement

def agY2 (n k : ℕ) : Fin 2 → ℕ
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 1
  • ag_two_upperUpper bound for two strategies. Every λ-Lipschitz anonymous game with two strategies (any number of players) has a 2λ-approximate pure…

Lean source view module on GitHub

/-- Two-strategy count vector with `k` others on strategy `1`. -/
def agY2 (n k : ℕ) : Fin 2 → ℕ := fun j => if j = 1 then k else n - 1 - k
See it in the graphDiscuss this resultChallenge it