agTot
def
Total number of players on each strategy.
Statement
open Finset in def agTot {n s : ℕ} (σ : Fin n → Fin s) (j : 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 5
- 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.
- agTot_sumThe total counts of a pure profile over all strategies sum to the number of players n.
- ag_four_lowerFour strategies: the lower bound sλ is attained. The 5-player, 4-strategy cyclic game is normalised and λ = 1/8-Lipschitz, yet has no pure…
- ag_three_lowerThree strategies: the lower bound exceeds sλ. The 5-player, 3-strategy cyclic game is normalised and λ = 1/8-Lipschitz, yet has no pure…
Lean source view module on GitHub
open Finset in /-- Total number of players on each strategy. -/ def agTot {n s : ℕ} (σ : Fin n → Fin s) (j : Fin s) : ℕ := (Finset.univ.filter (fun q => σ q = j)).card