Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(6.2) — Γ(ψ, c, v) is a potential game iff some Q has Q(ε_S) − Q(ε_{S∖{i}}) = ψ(v_{S∪{i}})(i) − cⁱ

Proved
MondererShapley.Participation.eq_6_2

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

game-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-games

Let ψ\psiψ be a solution, c∈RNc \in \mathbb R^Nc∈RN and vvv a TU game. For S⊆NS \subseteq NS⊆N let εS\varepsilon_SεS​ be the profile in which exactly the members of SSS choose 1. The participation game Γ(ψ,c,v)\Gamma(\psi, c, v)Γ(ψ,c,v) is a potential game if and only if there exists Q:Y→RQ : Y \to \mathbb RQ:Y→R such that

Q(εS)−Q(εS∖{i})=ψ(vS∪{i})(i)−cifor every S⊆N and every i∈S.Q(\varepsilon_S) - Q(\varepsilon_{S \setminus \{i\}}) = \psi(v_{S \cup \{i\}})(i) - c^i \qquad \text{for every } S \subseteq N \text{ and every } i \in S.Q(εS​)−Q(εS∖{i}​)=ψ(vS∪{i}​)(i)−cifor every S⊆N and every i∈S.

This is the reformulation of the potential property on coalitions used in the proof of Theorem 6.1.

Formalization Note Since i∈Si \in Si∈S, S∪{i}=SS \cup \{i\} = SS∪{i}=S; the statement keeps the page's S∪{i}S \cup \{i\}S∪{i}. Y={0,1}NY = \{0, 1\}^NY={0,1}N is ι → Bool; potential game means an exact potential in the sense of (2.2) with unit weights.

Preamble
import Mathlib
import Definitions.Def_MondererShapley_ClosedPath_IsPotentialGame
import Definitions.Def_MondererShapley_Participation_participationPayoff
import Definitions.Def_MondererShapley_Participation_profileOf
Formal statement
namespace MondererShapley.Participation

/-- (6.2): the participation game is a potential game iff there is `Q : Y → ℝ` with
`Q(ε_S) − Q(ε_{S∖{i}}) = ψ(v_{S∪{i}})(i) − cⁱ` for every `S ⊆ N` and every `i ∈ S`. -/
theorem eq_6_2 {ι : Type*} [Fintype ι] [DecidableEq ι] (ψ : Solution ι) (c : ι → ℝ)
    (v : Finset ι → ℝ) :
    MondererShapley.ClosedPath.IsPotentialGame (Y := fun _ : ι => Bool) (participationPayoff ψ c v) ↔
      ∃ Q : (ι → Bool) → ℝ, ∀ S : Finset ι, ∀ i ∈ S,
        Q (profileOf S) - Q (profileOf (S \ {i})) = ψ (S ∪ {i}) v i - c i := by sorry

end MondererShapley.Participation
Source
Monderer and Shapley, Potential Games, Games Econ. Behav. 14 (1996), p. 137 (PDF p. 14), proof of Theorem 6.1, (6.2)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me