(32:4) — domination in the reduced three-person game
ProvedTheoryOfGames.ThreePerson.dominates_iffcooperative-gamesp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1stable-sets
Consider the reduced essential zero-sum three-person game (32:1): when has elements. For imputations and of this game, domination holds if and only if
Only the two-element coalitions matter for domination in this game; the statement reduces the general definition (30:4) to a condition on coordinates and is the basis of the graphical method of 32.1.
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:4), 32.1.3: for imputations `α = {α₁, α₂, α₃}`, `β = {β₁, β₂, β₃}` of the reduced
three-person game (32:1), domination `α ⊱ β` means: either `α₁ > β₁, α₂ > β₂`; or
`α₁ > β₁, α₃ > β₃`; or `α₂ > β₂, α₃ > β₃` (players `1, 2, 3` are `0, 1, 2`). -/
theorem dominates_iff (α β : Fin 3 → ℝ) (hα : IsImputation redV α)
(hβ : IsImputation redV β) :
Dominates redV α β ↔
(β 0 < α 0 ∧ β 1 < α 1) ∨ (β 0 < α 0 ∧ β 2 < α 2) ∨ (β 1 < α 1 ∧ β 2 < α 2) := by sorry
end TheoryOfGames.ThreePerson
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 284, 32.1.3, (32:4)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.