(32:A) — for −1 ≦ c < ½ the imputations with αᵢ = c form a solution
ProvedTheoryOfGames.ThreePerson.lineSet_isSolutioncooperative-gamesp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1stable-sets
In the reduced essential zero-sum three-person game (32:1), let be a number with
and let . Then the set of all imputations with — the set (32:7), (32:7*) or (32:7**) for — is a solution in the sense of (30:5:a), (30:5:b).
These are the book's "discriminatory" solutions: player is assigned the fixed amount and the other two divide in every possible way. The bound is strict.
Formalization Note Players are indices 0, 1, 2.
Preamble
import Mathlib import Definitions.Def_TheoryOfGames_ThreePerson_Solution import Definitions.Def_TheoryOfGames_ThreePerson_ReducedThreePerson
Formal statement
namespace TheoryOfGames.ThreePerson
/-- (32:A) with (32:7), (32:7*), (32:7**), (32:8), 32.2.2: for every `c` with `-1 ≦ c < ½` and
every player `i`, the set of all imputations with `αᵢ = c` is a solution of the reduced
essential zero-sum three-person game (32:1). -/
theorem lineSet_isSolution (i : Fin 3) (c : ℝ) (hc1 : -1 ≤ c) (hc2 : c < 1 / 2) :
IsSolution redV (lineSet i c) := by sorry
end TheoryOfGames.ThreePerson
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), pp. 287–288, 32.2.2, (32:7), (32:7*), (32:7**), (32:8); p. 288, 32.2.3, (32:A)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.