CoalitionalGame.IsBalancedGame
defimported Lean
A game is balanced if every balanced collection satisfies the superadditivity-like condition. [MSZ 17.14 premise]
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {N : Type*} [DecidableEq N] [Fintype N] in variable (G : CoalitionalGame N ℝ) in def CoalitionalGame.IsBalancedGame : Prop
- Defined in
- EconCSLib, `CoalitionalGame.IsBalancedGame`
- 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.CoalitionalGame.IsBalancedGame← CoalitionalGame.IsBalancedGame (EconCSLib/GameTheory/CoalitionalGame/Core.lean:69): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- CoalitionalGameA coalitional game with transferable utility.
Nis the player type;Uis the utility type.vassigns a worth to each coalition, with…
- CoalitionalGameA coalitional game with transferable utility.
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] [Fintype N] in variable (G : CoalitionalGame N ℝ) in /-- A game is balanced if every balanced collection satisfies the superadditivity-like condition. [MSZ 17.14 premise] -/ def CoalitionalGame.IsBalancedGame : Prop := ∀ (𝒟 : Finset (Finset N)) (δ : Finset N → ℝ), (∀ S ∈ 𝒟, δ S > 0) → (∀ i : N, ∑ S ∈ 𝒟.filter (i ∈ ·), δ S = 1) → ∑ S ∈ 𝒟, δ S * G.v S ≤ G.v Finset.univ