is_simple_game
def
A simple game on n players is a monotone function v from coalitions to {0,1} with v(empty) = 0 and v(all players) = 1; the coalitions with value 1 are winning.
Statement
def is_simple_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 6
- 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.
- 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…
- 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.
- 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
/-- A simple game on `n` players (arXiv:2607.07013, Sec. 10): a monotone `v : 2^[n] → {0,1}` with `v(∅) = 0` and `v([n]) = 1`; coalitions with `v S = true` are winning. -/ def is_simple_game {n : ℕ} (v : Finset (Fin n) → Bool) : Prop := (∀ S T, S ⊆ T → v S = true → v T = true) ∧ v ∅ = false ∧ v Finset.univ = true