Proposition A.8 — g ∈ μ-NoG ∩ (μ,γ)-HG iff ∑ᵢ μⁱ(Sⁱ)γⁱgⁱ = 0 and Π(g) = g
ProvedDecompGames.Duplication.proposition_A_8game-decompositionharmonic-gamesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1
Let be a finite set of players; player has a finite strategy set , and is the set of strategy profiles. A game is a vector of payoff functions ; is the space of games. For let be a strictly positive measure on , the product measure, , and let be a co-measure vector, a strictly positive function of .
Let with (A.1), (A.6). A game is a -normalized -harmonic game if and only if
This characterization is what makes normalized potential and normalized harmonic games orthogonal (Proposition A.9).
Differences from the source:
- generalization: standing assumptions n ≥ 2 players and |Sⁱ| ≥ 2 strategies for every player (p. 7) → any finite type of players ι and any finite strategy sets S i, of any size; reason: the result holds without these assumptions (with an empty Sⁱ the space of profiles is empty and every game is 0); every instance of the source is an instance of the Lean statement
- encoding: μⁱ a strictly positive finite measure on Sⁱ → μ i : S i → ℝ, the point masses, with 0 < μ i a for all a (IsMeasureVec); reason: a measure on a finite set is determined by its point masses; μⁱ(Sⁱ) is mass μ i = ∑ₐ μ i a
- encoding: γⁱ a co-measure, a strictly positive measure on S⁻ⁱ (Definition 2.1) → γ i : (∀ j, S j) → ℝ positive with γ i (Function.update s i a) = γ i s (IsCoMeasureVec); reason: functions on S⁻ⁱ are exactly the functions on S that do not depend on the coordinate sⁱ
- encoding: statements over s⁻ⁱ ∈ S⁻ⁱ and profiles (tⁱ, s⁻ⁱ) → statements over full profiles s : ∀ j, S j, with (tⁱ, s⁻ⁱ) written Function.update s i tⁱ; reason: the coordinate sⁱ of s is overwritten, so the quantifier ranges over the same subprofiles
Preamble
import Mathlib import Definitions.Def_DecompGames_Duplication_Operators
Formal statement
namespace DecompGames.Duplication
open Finset
/-- Proposition A.8, p. 31: `g` is a `μ`-normalized `(μ, γ)`-harmonic game iff
`∑_{i ∈ N} μⁱ(Sⁱ) γⁱ gⁱ = 0` and `Π(g) = g`. -/
theorem proposition_A_8 {ι : Type} [Fintype ι] [DecidableEq ι] {S : ι → Type}
[∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)]
(μ : ∀ i, S i → ℝ) (hμ : IsMeasureVec μ)
(γ : ι → (∀ i, S i) → ℝ) (hγ : IsCoMeasureVec γ) :
∀ g : Game ι S, (IsNormalized μ g ∧ IsHarmonic μ γ g) ↔
((∀ s : ∀ j, S j, ∑ i, mass μ i * γ i s * g i s = 0) ∧ projGame μ g = g) := by sorry
end DecompGames.Duplication
Source
Abdou, Pnevmatikos, Scarsini & Venel, Decomposition of Games: Some Strategic Considerations, arXiv:1901.06048v2, p. 31, Proposition A.8
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.