Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 15.2: the VCG vector is the bidder-dominant core point when it lies in the core, and otherwise no bidder-dominant point exists and the auctioneer's VCG payoff is below every core payoff

Proved
SupplyChainTheory.vcg_bidder_dominant

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

auctionscooperative-gamescoreoperations-researchvcg

Theorem 15.2. If the VCG payoff vector πˉ\bar\piπˉ lies in the core, then it is the bidder-dominant point; otherwise, there is no bidder-dominant point in the core, and the auctioneer's VCG payoff is strictly less than the smallest of the auctioneer's core payoffs, πˉ0<π^0\bar\pi_0 < \hat\pi_0πˉ0​<π^0​ for every π^∈C(L,V)\hat\pi \in C(L, V)π^∈C(L,V).

The first part is Lemma 15.1. For the second, any core vector π^\hat\piπ^ pays every bidder at most its VCG payoff and some bidder strictly less, so it pays the auctioneer strictly more than πˉ0\bar\pi_0πˉ0​; and the core vector of Lemma 15.1 for that bidder shows π^\hat\piπ^ is not bidder dominant. The theorem says the VCG auction's revenue falls below every competitive outcome unless its payoff vector is in the core.

Preamble
import Definitions.Def_SupplyChainTheory_auctions
Formal statement
namespace SupplyChainTheory

theorem vcg_bidder_dominant {n : ℕ} (V : Finset (Fin (n + 1)) → ℝ) (hV : IsCoalitionalValue V) :
    (InCore V Finset.univ (vcgPayoff V Finset.univ) → BidderDominant V Finset.univ (vcgPayoff V Finset.univ))
      ∧ (¬ InCore V Finset.univ (vcgPayoff V Finset.univ) →
          (¬ ∃ π, BidderDominant V Finset.univ π)
          ∧ ∀ π, InCore V Finset.univ π → vcgPayoff V Finset.univ 0 < π 0) := 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. 607, Sect. 15.4.3, Theorem 15.2 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