AFTD Auto-Formalizing Theoretical Domains

agMP_normalized

theoremverified

Matching pennies, written as a 2-player 2-strategy anonymous game, has payoffs in [0,1].

Statement

theorem agMP_normalized : agMP.Normalized
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
Classical.choiceQuot.soundpropext
Built on 2
  • AGGame.NormalizedPayoffs lie in [0, 1] (the normalisation of arXiv 0710.5582) on all partitions of the other n − 1 players.
  • agMPMatching pennies as a 2-player, 2-strategy anonymous game: player 0 wants to match the other player, player 1 wants to mismatch.
Used by 1
  • ag_two_exactExact answer for two strategies. For anonymous games with s = 2 strategies the best possible pure approximation is exactly 2λ = sλ: every…

Lean source view module on GitHub

theorem agMP_normalized : agMP.Normalized := by  intro p i y _  simp only [agMP]  split_ifs <;> norm_num
See it in the graphDiscuss this resultChallenge it