(32:B) — the set (32:6) is a solution of the reduced three-person game
ProvedTheoryOfGames.ThreePerson.middlePointsSet_isSolutioncooperative-gamesp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1stable-sets
In the reduced essential zero-sum three-person game (32:1), the set of the three imputations
is a solution in the sense of (30:5:a), (30:5:b).
This is the solution the book had singled out heuristically in 29.1 (the set of Figure 51): each two-person coalition splits its gain equally and the excluded player gets .
Preamble
import Mathlib import Definitions.Def_TheoryOfGames_ThreePerson_Solution import Definitions.Def_TheoryOfGames_ThreePerson_ReducedThreePerson
Formal statement
namespace TheoryOfGames.ThreePerson
/-- (32:B) with (32:6), 32.2.1: the set `{-1, ½, ½}, {½, -1, ½}, {½, ½, -1}` is a solution of
the reduced essential zero-sum three-person game (32:1). -/
theorem middlePointsSet_isSolution : IsSolution redV middlePointsSet := by sorry
end TheoryOfGames.ThreePerson
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 287, 32.2.1, (32:6); p. 288, 32.2.3, (32:B)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.