(57:C) — the set of all players is removable iff the game is inessential
ProvedTheoryOfGames.GeneralGames.univ_removable_iffcharacteristic-functiongame-theoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1zero-sum-games
Let be a zero-sum -person game with characteristic function , . Then the set is removable for in the sense of (57:A) (there is a zero-sum -person game with the same characteristic function in which no player has an influence on the payoffs) if and only if is inessential, i.e. there are constants with
Together with (57:B) it shows that the players of an essential game are removable individually but not all simultaneously.
Preamble
import Mathlib import Definitions.Def_TheoryOfGames_GeneralGames_GeneralGame import Definitions.Def_TheoryOfGames_GeneralGames_charFun import Definitions.Def_TheoryOfGames_GeneralGames_Removable
Formal statement
namespace TheoryOfGames.GeneralGames
/-- (57:C), 57.4.2: for a zero-sum `n`-person game `Γ`, the set `S = I = (1, …, n)` is
removable (in the sense of (57:A)) if and only if the game `Γ` is inessential. -/
theorem univ_removable_iff {n : ℕ} (Γ : GeneralGame n) (hΓ : Γ.IsZeroSum) :
Γ.IsRemovable Finset.univ ↔ IsInessential Γ.restrictedCharFun := by sorry
end TheoryOfGames.GeneralGames
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 534, 57.4.2, (57:C), (57:12), (57:13)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.