swing_table
def
The swing table of a game: T(i, k) is the number of coalitions S of size k not containing i such that S together with i wins while S loses.
Statement
def swing_table {n : ℕ} (v : Finset (Fin n) → Bool) (i : Fin n) (k : ℕ) : ℕ- Defined in
- What Semivalues Cannot See: The Information Content of Anonymous Marginal Values, arXiv:2607.07013, Sec. 10 (simple game, weighted game as in the monograph Simple Games: Desirability Relations, Trading, Pseudoweightings (1999), swing table)
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Used by 10
- simple_game_card_size_eq_of_swing_table_eqIf two simple games have the same swing table, then for every k they have the same number of winning coalitions of size k.
- sum_swing_table_eqFor a monotone game, the sum over all players of T(i, k) equals (k+1) w(k+1) - (n-k) w(k), where w(k) is the number of winning coalitions…
- sum_range_swing_table_eqFor a monotone game, player i's total swing count (the sum of T(i, k) over k) equals 2 A_i - |W|, where A_i is the number of winning…
- weighted_game_eq_of_swing_table_eqThe swing-rigidity conjecture (arXiv:2607.07013, Conjecture 10.2) is true: if f is a weighted simple game and g is any simple game with…
- swing_table_cast_eq_sumFor a monotone game, T(i, k) equals the sum over coalitions S of size k not containing i of v(S with i) - v(S).
- exists_simple_games_ne_of_swing_table_eqExample 10.1 of arXiv:2607.07013: the five-player simple games with minimal winning coalitions {1,2,3}, {0,2,4}, {0,3,4}, {1,3,4} and…
- simple_game_card_winning_mem_eq_of_swing_table_eqIf two simple games have the same swing table, then for every player i they have the same number of winning coalitions containing i.
- swing_table_eq_zero_of_ltIn a game on n players, T(i, k) = 0 whenever k > n.
- simple_game_card_winning_eq_of_swing_table_eqIf two simple games have the same swing table, they have the same number of winning coalitions.
- exists_not_weighted_simple_games_ne_of_swing_table_eqThe weighted hypothesis in swing rigidity cannot be dropped: there are two different five-player simple games, neither of them weighted,…
Lean source view module on GitHub
/-- The swing table of a game (arXiv:2607.07013, Sec. 10): `T i k` counts the coalitions `S` of size `k` not containing `i` for which `i` is a swing, i.e. `S ∪ {i}` wins and `S` loses. -/ def swing_table {n : ℕ} (v : Finset (Fin n) → Bool) (i : Fin n) (k : ℕ) : ℕ := (Finset.univ.filter fun S : Finset (Fin n) => i ∉ S ∧ S.card = k ∧ v (insert i S) = true ∧ v S = false).card