Theorem 2.8, path-independence claim (A.1)
ProvedMondererShapley.ClosedPath.I_eq_of_same_endpointsgame-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-games
Assume for every finite closed path . If two finite paths and have the same initial vertex and the same terminal vertex, then
The path sum therefore depends only on its endpoints, making the potential constructed in equation (A.1) well defined.
Formalization Note The paths carry their unique deviators explicitly, and no finiteness condition is placed on players' strategy sets.
Preamble
import Mathlib import Definitions.Def_MondererShapley_ClosedPath_FinPath
Formal statement
namespace MondererShapley.ClosedPath
variable {ι : Type*} [DecidableEq ι] {Y : ι → Type*}
/-- Theorem 2.8, proof of (2) implies (1), path-independence claim (A.1), p. 138. -/
theorem I_eq_of_same_endpoints [Fintype ι]
(u : ι → (∀ i, Y i) → ℝ)
(hclosed : ∀ γ : FinPath Y, γ.IsClosed → γ.I u = 0)
(γ₁ γ₂ : FinPath Y)
(hstart : γ₁.pt 0 = γ₂.pt 0)
(hend : γ₁.pt (Fin.last γ₁.len) = γ₂.pt (Fin.last γ₂.len)) :
γ₁.I u = γ₂.I u := by sorry
end MondererShapley.ClosedPath
Source
Monderer and Shapley, Potential Games, Games Econ. Behav. 14 (1996), p. 138 (PDF p. 15), Theorem 2.8, proof (2) ⇒ (1), claim preceding (A.1); https://doi.org/10.1006/game.1996.0044
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.