agCnt
def
Number of players other than p using strategy j in the pure profile σ.
Statement
open Finset in def agCnt {n s : ℕ} (σ : Fin n → Fin s) (p : Fin n) (j : Fin s) : ℕ
- Defined in
- Computing Equilibria in Anonymous Games, FOCS 2007 (arXiv:0710.5582), Sections 1-2 and the concluding conjecture that s*lambda is a lower bound for the approximation of pure Nash equilibria; formalized by the operator (Claude), 2026-10-05
- Verified
- 05 Oct 2026
- Axioms
- none listed
- Used by 7
- agCnt_eqThe count of other players on strategy j seen by player p is the total count on j minus one if p plays j.
- agCyc_regretFrom a regret-2 certificate on the totals to a player with regret 1/2.
- agMP_checkFinite check: in matching pennies, every pure profile ![a, b] leaves some player with regret at least 1.
- ag_two_upperUpper bound for two strategies. Every λ-Lipschitz anonymous game with two strategies (any number of players) has a 2λ-approximate pure…
- AGGame.PureNEThe pure profile σ is an ε-approximate pure Nash equilibrium.
- agCnt_sumThe counts of the others always form a partition of n − 1.
- agMP_no_pureNEIn matching pennies every pure profile leaves a player with regret 1 = 2λ.
Lean source view module on GitHub
open Finset in /-- Number of players other than `p` using strategy `j` in the pure profile `σ`. -/ def agCnt {n s : ℕ} (σ : Fin n → Fin s) (p : Fin n) (j : Fin s) : ℕ := (Finset.univ.filter (fun q => q ≠ p ∧ σ q = j)).card