Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(6.1) — joining changes player i's payoff by ψ(v_{S∪{i}})(i) − cⁱ

Proved
MondererShapley.Participation.eq_6_1

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, vvv a TU game, and uiu^iui the payoffs of the participation game Γ(ψ,c,v)\Gamma(\psi, c, v)Γ(ψ,c,v). For every player iii and every profile ε∈Y={0,1}N\varepsilon \in Y = \{0,1\}^Nε∈Y={0,1}N, with S={j≠i:εj=1}S = \{ j \ne i : \varepsilon^j = 1\}S={j=i:εj=1} the other participants,

ui(ε−i,1)−ui(ε−i,0)=ψ(vS∪{i})(i)−ci.u^i(\varepsilon^{-i}, 1) - u^i(\varepsilon^{-i}, 0) = \psi(v_{S \cup \{i\}})(i) - c^i.ui(ε−i,1)−ui(ε−i,0)=ψ(vS∪{i}​)(i)−ci.

This identity reduces the potential property of Γ(ψ,c,v)\Gamma(\psi, c, v)Γ(ψ,c,v) to a condition on coalitions; it is the first step of the proof of Theorem 6.1.

Formalization Note (ε−i,1)(\varepsilon^{-i}, 1)(ε−i,1) and (ε−i,0)(\varepsilon^{-i}, 0)(ε−i,0) are Function.update ε i true and Function.update ε i false. No hypothesis on ψ\psiψ or vvv is needed.

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

/-- (6.1): `uⁱ(ε⁻ⁱ, 1) − uⁱ(ε⁻ⁱ, 0) = ψ(v_{S∪{i}})(i) − cⁱ` with `S = {j ≠ i : εʲ = 1}`. -/
theorem eq_6_1 {ι : Type*} [Fintype ι] [DecidableEq ι] (ψ : Solution ι) (c : ι → ℝ)
    (v : Finset ι → ℝ) (i : ι) (ε : ι → Bool) :
    participationPayoff ψ c v i (Function.update ε i true) -
        participationPayoff ψ c v i (Function.update ε i false) =
      ψ (Finset.univ.filter (fun j => j ≠ i ∧ ε j = true) ∪ {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.1)
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