Theorem 6.2 — closest potential game and closest harmonic game
ProvedHarmonicGames.Projection.theorem_6_2Throughout, is a finite set of players and each player has a nonempty finite strategy set with strategies; a game is given by utilities on the profiles . Let be the operator (21), the combinatorial gradient of the game graph, , and the norm (56). For a game with utilities put
Theorem 6.2. With respect to the norm (56):
- the closest potential game to has utilities for all ;
- the closest harmonic game to has utilities for all .
Each item is stated as a characterization: a game is a closest potential game to (a potential game minimizing over all potential games) if and only if for every ; likewise for harmonic games (games in ). This gives at once that the closest game exists, is unique, and is given by the formula. Note that is applied to the same function for every player.
The closed forms show that the closest potential game keeps the nonstrategic part of the game and replaces its strategic part by the preferences induced by the potential .
Formalization Note and are Moore–Penrose pseudoinverses for the unweighted inner products of Sections 3–4; "closest" refers to the weighted norm (56). The definite article in "the closest potential game" is rendered by the "if and only if".
import Mathlib import Definitions.Def_HarmonicGames_Projection_Closest
namespace HarmonicGames.Projection
/-- **Theorem 6.2** (p. 36). Let `u` be a game and `φ = δ0† D u`. With respect to the norm (56):
1. the closest potential game to `u` is unique and has utilities `Π_m φ + (I - Π_m) u^m`;
2. the closest harmonic game to `u` is unique and has utilities `u^m - Π_m φ`. -/
theorem theorem_6_2 {ι : Type} [Fintype ι] [DecidableEq ι] (E : ι → Type)
[∀ m, Fintype (E m)] [∀ m, DecidableEq (E m)] [∀ m, Nonempty (E m)]
(u : ι → (∀ m, E m) → ℝ) (φ : HarmonicGames.Decomposition.Util E) (hφ : φ = HarmonicGames.Decomposition.potentialFunction E (toGames E u)) :
(∀ û : ι → (∀ m, E m) → ℝ, IsClosestPotential E u û ↔
û = fun m p => HarmonicGames.Decomposition.Pim E m φ p + (u m p - HarmonicGames.Decomposition.Pim E m (WithLp.toLp 2 (u m)) p)) ∧
(∀ û : ι → (∀ m, E m) → ℝ, IsClosestHarmonic E u û ↔
û = fun m p => u m p - HarmonicGames.Decomposition.Pim E m φ p) := by sorry
end HarmonicGames.Projection
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.