AFTD Auto-Formalizing Theoretical Domains

agMPv

def

Integer form of the matching-pennies payoffs.

Statement

def agMPv (p i : Fin 2) (y : 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 3
  • agMP_u_eqThe rational payoff of matching pennies equals its integer payoff table agMPv.
  • agMP_checkFinite check: in matching pennies, every pure profile ![a, b] leaves some player with regret at least 1.
  • agMP_no_pureNEIn matching pennies every pure profile leaves a player with regret 1 = 2λ.

Lean source view module on GitHub

/-- Integer form of the matching-pennies payoffs. -/
def agMPv (p i : Fin 2) (y : Fin 2 → ℕ) : ℕ :=
  if p = 0 then (if y i = 1 then 1 else 0) else (if y i = 0 then 1 else 0)
See it in the graphDiscuss this resultChallenge it