AFTD Auto-Formalizing Theoretical Domains

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

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
See it in the graphDiscuss this resultChallenge it