THEOREM A (§3), p. 1133 — if player i plays a solution of (3.1) every period, all regrets Rⁱ_t(j,k), j ≠ k, converge to 0 a.s.
ProvedRegretMatching.Approach.theorem_ALet be a finite game and fix a player . The game is played repeatedly; given the history , players randomize independently. Suppose that at every period (for ) player chooses strategies according to a probability vector that satisfies (3.1):
with . Nothing is assumed about how the other players choose their strategies, and player 's first-period strategy is arbitrary. Then, almost surely,
By the Proposition of §3, this implies that when every player follows such a procedure, the empirical distributions of play converge almost surely to the set of correlated equilibria (the Corollary).
Formalization Note. Behaviour is a profile assigning to each period, history and player a probability vector; only player 's component is constrained, by (3.1) at every history of length . The play is any sequence of random variables on any probability space whose conditional law given each positive-probability history is the product of the players' mixed actions. The quantifier "for every " is placed inside the almost-sure statement, which is equivalent since is finite.
import Mathlib import Definitions.Def_RegretMatching_Approach_Setting open MeasureTheory ProbabilityTheory Filter Topology
namespace RegretMatching.Approach
theorem theorem_A
{ι : Type} [Fintype ι] [DecidableEq ι]
{S : ι → Type} [∀ i, Fintype (S i)] [∀ i, DecidableEq (S i)] [∀ i, Nonempty (S i)]
(u : ι → (∀ i, S i) → ℝ) (i : ι)
(σ : (t : ℕ) → (Fin t → (∀ i, S i)) → (i' : ι) → S i' → ℝ)
(hσ : ∀ (t : ℕ) (h : Fin t → (∀ i, S i)) (i' : ι), σ t h i' ∈ stdSimplex ℝ (S i'))
(h31 : ∀ (t : ℕ) (h : Fin (t + 1) → (∀ i, S i)), SatisfiesEq31 u h i (σ (t + 1) h i))
(Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(play : ℕ → Ω → (∀ i, S i)) (hplay : RegretMatching.Main.IsPlay σ P play) :
∀ᵐ ω ∂P, ∀ j k : S i, j ≠ k →
Tendsto (fun t : ℕ => RegretMatching.Main.regretR u (hist play (t + 1) ω) i j k) atTop (𝓝 0) := by sorry
end RegretMatching.Approach
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.