agCycV
def
Integer numerator of the cyclic game's payoff.
Statement
def agCycV {s : ℕ} [NeZero s] (i : Fin s) (y : 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
- agCyc_regretFrom a regret-2 certificate on the totals to a player with regret 1/2.
- agCyc_normalizedThe cyclic game with n = 5 players has payoffs in [0, 1].
- agCyc_u_eqThe payoff of the cyclic anonymous game is the integer table agCycV divided by 4.
- agCyc4_checkFinite check for four strategies and five players.
- agCyc3_checkFinite check for three strategies and five players (totals a + b + d = 5).
Lean source view module on GitHub
/-- Integer numerator of the cyclic game's payoff. -/ def agCycV {s : ℕ} [NeZero s] (i : Fin s) (y : Fin s → ℕ) : ℕ := y (i + 1) + min (y i) 2