is_weighted_game
def
A game is weighted if there are nonnegative player weights w and a quota q such that a coalition wins exactly when its total weight is at least q.
Statement
def is_weighted_game {n : ℕ} (v : Finset (Fin n) → Bool) : Prop
- 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 3
- 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…
- weighted_game_eq_of_chow_parameters_eqChow's theorem for games: if f is weighted and g is any 0/1-valued function on coalitions with the same number of winning coalitions and,…
- 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
/-- A game is weighted (Taylor-Zwicker): there are nonnegative weights `w` and a quota `q` such that a coalition wins exactly when its total weight reaches the quota. -/ def is_weighted_game {n : ℕ} (v : Finset (Fin n) → Bool) : Prop := ∃ (w : Fin n → ℝ) (q : ℝ), (∀ i, 0 ≤ w i) ∧ ∀ S, v S = true ↔ q ≤ ∑ i ∈ S, w i