AFTD Auto-Formalizing Theoretical Domains

CoalitionalGame.IsSimple

defimported Lean

A game is simple if every coalition's worth is 0 or 1, and the grand coalition's worth is 1. [MSZ 16.2] Requires [Fintype N] and [One U].

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {N : Type*} [DecidableEq N] {U : Type*} [AddZeroClass U] in
variable (G : CoalitionalGame N U) in
def CoalitionalGame.IsSimple [Fintype N] [One U] : Prop
Defined in
EconCSLib, `CoalitionalGame.IsSimple`
Lean proof
By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at 1a88f809b538 (Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 1
  • CoalitionalGameA coalitional game with transferable utility. N is the player type; U is the utility type. v assigns a worth to each coalition, with…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
variable {N : Type*} [DecidableEq N] {U : Type*} [AddZeroClass U] in
variable (G : CoalitionalGame N U) in
/-- A game is simple if every coalition's worth is 0 or 1, and the grand coalition's worth is 1. [MSZ 16.2] Requires `[Fintype N]` and `[One U]`. -/
def CoalitionalGame.IsSimple [Fintype N] [One U] : Prop :=
  (∀ S : Finset N, G.v S = 0 ∨ G.v S = 1) ∧ G.v Finset.univ = 1
See it in the graphDiscuss this resultChallenge it