(31:K) — never α ⊱ α
ProvedTheoryOfGames.ThreePerson.never_dominates_selfcooperative-gamesp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1stable-sets
Let be a function on the subsets of the player set and let be an imputation for . Then does not dominate itself:
Domination is irreflexive; this is used whenever a one-element set is tested as a solution, as in (31:O).
Preamble
import Mathlib import Definitions.Def_TheoryOfGames_ThreePerson_Solution
Formal statement
namespace TheoryOfGames.ThreePerson
/-- (31:K), 31.2.2: never `α ⊱ α`. -/
theorem never_dominates_self {n : ℕ} (v : Finset (Fin n) → ℝ) (α : Fin n → ℝ)
(hα : IsImputation v α) : ¬ Dominates v α α := by sorry
end TheoryOfGames.ThreePerson
Source
von Neumann & Morgenstern, Theory of Games and Economic Behavior (60th-anniversary ed., Princeton 2007), p. 278, 31.2.2, (31:K)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.