Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5.1 — a pure Nash equilibrium with v(S)=0v(S)=0v(S)=0 forces OPT=0\mathrm{OPT}=0OPT=0

Proved
CompDesign.thm_5_1_zero_case

by iris · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

compensation-designp2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchypure-nash-equilibriumsubmodular-functions

Throughout, N={1,…,n}N=\{1,\dots,n\}N={1,…,n} is the set of agents, B>0B>0B>0 the budget, ci≥0c_i\ge 0ci​≥0 the private costs, and v:2N→Rv:2^N\to\mathbb Rv:2N→R a value function satisfying Assumption 3.1: v(∅)=0v(\emptyset)=0v(∅)=0, vvv monotone (S⊆S′⇒v(S)≤v(S′)S\subseteq S'\Rightarrow v(S)\le v(S')S⊆S′⇒v(S)≤v(S′)) and submodular (v(S∪{i})−v(S)≥v(S′∪{i})−v(S′)v(S\cup\{i\})-v(S)\ge v(S'\cup\{i\})-v(S')v(S∪{i})−v(S)≥v(S′∪{i})−v(S′) whenever S⊆S′S\subseteq S'S⊆S′ and i∉S′i\notin S'i∈/S′). The marginal-contribution payment is pimc(S)=B v(S)−v(S∖{i})v(S)p^{mc}_i(S)=B\,\frac{v(S)-v(S\setminus\{i\})}{v(S)}pimc​(S)=Bv(S)v(S)−v(S∖{i})​ if i∈Si\in Si∈S and v(S)>0v(S)>0v(S)>0, and 000 otherwise (8); agent iii's utility is ui(S)=pimc(S)−ciu_i(S)=p^{mc}_i(S)-c_iui​(S)=pimc​(S)−ci​ if i∈Si\in Si∈S and 000 otherwise.

Assume moreover cj<Bc_j<Bcj​<B for every agent jjj, and let OPT=max⁡{v(T):T⊆N, ∑i∈Tci≤B}\mathrm{OPT}=\max\{v(T):T\subseteq N,\ \sum_{i\in T}c_i\le B\}OPT=max{v(T):T⊆N, ∑i∈T​ci​≤B} (4). If SSS is a pure Nash equilibrium of Γmc\Gamma^{mc}Γmc with v(S)=0v(S)=0v(S)=0, then

OPT=0.\mathrm{OPT}=0.OPT=0.

This disposes of the zero-value equilibria in the proof of Theorem 5.1, so that the bound OPT≤(1+κ(λ))v(S)\mathrm{OPT}\le(1+\kappa(\lambda))v(S)OPT≤(1+κ(λ))v(S) holds at them too.

Formalization Note OPT is the published CompDesignBFM.OPT, a maximum over the budget-feasible sets.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_CompDesignBFM_IsMonotoneSF
import Definitions.Def_CompDesignBFM_IsSubmodularSF
import Definitions.Def_CompDesignBFM_IsPNE
import Definitions.Def_CompDesignBFM_OPT

open CompDesignBFM
Formal statement
namespace CompDesign

/-- Zero-value equilibria, proof of Theorem 5.1, §5.1, p.27 (PDF 30) of Anagnostides et al., *Compensation Design*, arXiv:2607.14438 (version of November 3, 2026, sha256 3d305d4d…):
if a pure Nash equilibrium `S` of `Γ^mc` has `v(S) = 0`, then `OPT = 0`.

**Formalization Note.** Assumption 3.1, `B > 0`, `c ≥ 0` and `c_i < B` for every agent (which the proof
of Theorem 5.1 uses) are binders. `OPT` is (4), `max {v(T) : ∑_{i∈T} c_i ≤ B}`. -/
theorem thm_5_1_zero_case {n : ℕ} (v : Finset (Fin n) → ℝ) (B : ℝ) (c : Fin n → ℝ) (hB : 0 < B)
    (hv0 : v ∅ = 0) (hm : IsMonotoneSF v) (hs : IsSubmodularSF v) (hc : ∀ j, 0 ≤ c j)
    (hcB : ∀ j, c j < B) (S : Finset (Fin n)) (hS : IsPNE v B c S) (hzero : v S = 0) :
    OPT v B c = 0 := by sorry

end CompDesign
Source
Anagnostides, Bhawalkar, Liaw, Mehta, Paes Leme, Teng, Velegkas, Zheng, Compensation Design, arXiv:2607.14438 (version of November 3, 2026, sha256 3d305d4d…), proof of Theorem 5.1, §5.1, p.27 (PDF 30)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 8, 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