Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma B.1 — congestion payoffs decomposed by the number of users of each facility

Proved
MondererShapley.Congestion.lemma_B_1

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

congestion-gamesgame-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-games

Let CCC be a congestion game with players N={1,…,n}N = \{1, \dots, n\}N={1,…,n}, facilities MMM, strategy sets Σi\Sigma^iΣi and facility payoffs cjc_jcj​, and payoffs vi(A)=∑j∈Aicj(σj(A))v^i(A) = \sum_{j\in A^i} c_j(\sigma_j(A))vi(A)=∑j∈Ai​cj​(σj​(A)) as in (3.1). For A=(A1,…,An)∈ΣA = (A^1, \dots, A^n) \in \SigmaA=(A1,…,An)∈Σ and S⊆NS \subseteq NS⊆N write A(S)=⋃k∈SAkA(S) = \bigcup_{k\in S} A^kA(S)=⋃k∈S​Ak, A(−S)=A(Sc)A(-S) = A(S^c)A(−S)=A(Sc), and A(i)=A({i})A(i) = A(\{i\})A(i)=A({i}), A(−i)=A(−{i})A(-i) = A(-\{i\})A(−i)=A(−{i}). For x∈RMx \in \mathbb{R}^Mx∈RM and B⊆MB \subseteq MB⊆M write x(B)=∑j∈Bx(j)x(B) = \sum_{j\in B} x(j)x(B)=∑j∈B​x(j). For every r∈{1,…,n}r \in \{1, \dots, n\}r∈{1,…,n} define xr∈RMx^r \in \mathbb{R}^Mxr∈RM by xr(j)=cj(r)x^r(j) = c_j(r)xr(j)=cj​(r).

Then for every i∈Ni \in Ni∈N and every A∈ΣA \in \SigmaA∈Σ,

vi(A)=x1(A(i)∩A(−i)c)+x2(⋃k≠i[A(i)∩A(k)∩A(−{i,k})c])+⋯+xn(⋂k∈NA(k)).(B.1)v^i(A) = x^1\big(A(i)\cap A(-i)^c\big) + x^2\Big(\bigcup_{k\neq i}\big[A(i)\cap A(k)\cap A(-\{i,k\})^c\big]\Big) + \cdots + x^n\Big(\bigcap_{k\in N} A(k)\Big). \tag{B.1}vi(A)=x1(A(i)∩A(−i)c)+x2(k=i⋃​[A(i)∩A(k)∩A(−{i,k})c])+⋯+xn(k∈N⋂​A(k)).(B.1)

The rrr-th term is xrx^rxr evaluated on the set of facilities used by player iii together with exactly r−1r-1r−1 other players, namely ⋃S∋i, ∣S∣=r[⋂k∈SA(k)∩A(−S)c]\bigcup_{S \ni i,\ |S| = r}\big[\bigcap_{k\in S} A(k) \cap A(-S)^c\big]⋃S∋i, ∣S∣=r​[⋂k∈S​A(k)∩A(−S)c]. The lemma rewrites a congestion game as a sum of "level" contributions, which is the form in which the proof of Theorem 3.2 builds a congestion game with prescribed payoffs.

Formalization Note. The page prints xr(j)=cj(m)x^r(j) = c_j(m)xr(j)=cj​(m); mmm is the number of facilities, and the lemma "follows from (3.1)" only with cj(r)c_j(r)cj​(r), so the misprint is corrected. The "⋯\cdots⋯" is read as the general term above, whose cases r=1,2,nr = 1, 2, nr=1,2,n are the printed ones; nnn is Fintype.card ι. The congestion game is the published model with cj(r)c_j(r)cj​(r) = G.latency j r.

Preamble
import Mathlib
import Definitions.Def_CongestionPoA_AsymSum_Model
import Definitions.Def_MondererShapley_Congestion_congestionPayoff

open CongestionPoA.AsymSum
Formal statement
namespace MondererShapley.Congestion

/-- Monderer and Shapley (1996), p. 139, Lemma B.1, (B.1): in a congestion game, with
`x^r(j) = c_j(r)`, every payoff decomposes by the number of users of each facility:
`vⁱ(A) = x¹(A(i) ∩ A(−i)^c) + x²(∪_{k≠i}[A(i) ∩ A(k) ∩ A(−{i,k})^c]) + ⋯ + xⁿ(∩_{k∈N} A(k))`,
where `A(S) = ∪_{k∈S} Aᵏ` and `A(−S) = A(Sᶜ)`.

**Formalization Note.** The printed `x^r(j) = c_j(m)` is a misprint for `c_j(r)`. The `r`-th term is
read as `x^r(∪_{S ∋ i, |S| = r} [∩_{k∈S} A(k) ∩ A(−S)^c])`, whose cases `r = 1, 2, n` are the printed
ones; `n = Fintype.card ι`. -/
theorem lemma_B_1 {ι M : Type*} [Fintype ι] [DecidableEq ι] [Fintype M] [DecidableEq M]
    (G : CongestionGame ι M) (i : ι) (A : ∀ k, ↥(G.strategies k)) :
    congestionPayoff G i A =
      ∑ r ∈ Finset.Icc 1 (Fintype.card ι),
        ∑ j ∈ Finset.univ.filter (fun j : M => ∃ S : Finset ι, i ∈ S ∧ S.card = r ∧
            (∀ k ∈ S, j ∈ (A k : Finset M)) ∧ ∀ k ∉ S, j ∉ (A k : Finset M)),
          G.latency j r := by sorry

end MondererShapley.Congestion
Source
Monderer and Shapley, Potential Games, Games Econ. Behav. 14 (1996), p. 139 (PDF p. 16), Lemma B.1, (B.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