25.3.1 — the characteristic function of every zero-sum n-person game satisfies (25:3:a)–(25:3:c)
ProvedTheoryOfGames.CharFun.charFun_isCharFunctioncharacteristic-functiongame-theoryp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1zero-sum-games
Let be a zero-sum -person game in normalized form (finitely many pure strategies for each player , real payoffs with ), and let be its characteristic function (25.1.3): the value of the two-person game between the coalition and its complement , the coalition mixing jointly over its members' strategy tuples. Then fulfills
that is, (25:3:a)–(25:3:c), for all subsets of .
This is the "only if" half of the characterization of characteristic functions in 26.2.
Formalization Note Players are Fin n, coalitions Finset (Fin n), is Sᶜ.
Preamble
import Mathlib import Definitions.Def_TheoryOfGames_CharFun_ZeroSumGame import Definitions.Def_TheoryOfGames_CharFun_charFun import Definitions.Def_TheoryOfGames_CharFun_IsCharFunction
Formal statement
namespace TheoryOfGames.CharFun
/-- 25.3.1: the characteristic function `v(S)` of every zero-sum `n`-person game fulfills
(25:3:a) `v(∅) = 0`, (25:3:b) `v(-S) = -v(S)` and (25:3:c) `v(S ∪ T) ≥ v(S) + v(T)` if
`S ∩ T = ∅`. -/
theorem charFun_isCharFunction {n : ℕ} (Γ : ZeroSumGame n) :
IsCharFunction Γ.charFun := by sorry
end TheoryOfGames.CharFun
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 241, 25.3.1, (25:3:a)–(25:3:c)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.