Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 15.1: the core is nonempty and each bidder's VCG payoff is the largest payoff it receives at any core point

Proved
SupplyChainTheory.vcg_core_lemma

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

auctionscooperative-gamescoreoperations-researchvcg

Lemma 15.1. For a coalitional value function VVV on the players L={0}∪NL = \{0\} \cup NL={0}∪N, the core C(L,V)C(L, V)C(L,V) is nonempty, and for every bidder kkk,

πˉk  =  max⁡{πk:π∈C(L,V)},\bar\pi_k \;=\; \max\{\pi_k : \pi \in C(L, V)\},πˉk​=max{πk​:π∈C(L,V)},

the VCG payoff πˉk=V(L)−V(L∖k)\bar\pi_k = V(L) - V(L \setminus k)πˉk​=V(L)−V(L∖k) is the greatest payoff bidder kkk receives at any point of the core. The book's proof: the vector paying V(L∖k)V(L \setminus k)V(L∖k) to the auctioneer, V(L)−V(L∖k)V(L) - V(L \setminus k)V(L)−V(L∖k) to kkk and nothing to the other bidders lies in the core, and any core vector paying kkk more would pay the coalition L∖kL \setminus kL∖k less than V(L∖k)V(L \setminus k)V(L∖k).

Preamble
import Definitions.Def_SupplyChainTheory_auctions
Formal statement
namespace SupplyChainTheory

theorem vcg_core_lemma {n : ℕ} (V : Finset (Fin (n + 1)) → ℝ) (hV : IsCoalitionalValue V) :
    (∃ π, InCore V Finset.univ π)
      ∧ ∀ k : Fin (n + 1), k ≠ 0 →
        IsGreatest {x | ∃ π, InCore V Finset.univ π ∧ x = π k} (vcgPayoff V Finset.univ k) := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 606, Sect. 15.4.3, Lemma 15.1 and its proof
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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